Results 81 to 90 of about 5,473,828 (218)
Reformulation and decomposition of integer programs [PDF]
In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based ...
WOLSEY , Laurence +1 more
core
Assessing second‐price auctions for parcel exchanges in last‐mile logistics
Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley +1 more source
Abstract This work aims at minimizing the energy purchase costs related to the operation of a green hydrogen production plant connected both to an intermittent, uncertain renewable energy source and to the power grid. We focus on scenarios where, for economic or environmental reasons, the plant must primarily meet hydrogen demand using electricity from
Victor Spitzer +5 more
wiley +1 more source
Source-grid-load-storage coordinated operation control is an operation mode and technology that can maximize the utilization of energy resources, and can economically, efficiently and securely improve the power dynamic balance capability of power systems
ZHU Jianguo +5 more
doaj +1 more source
A genetic algorithm for scheduling an automated machine cell with tool and pallet–fixture setups
Abstract This paper solves the scheduling problem of identical parallel machines with tooling and pallet–fixture constraints in a high‐mix, low‐volume, high‐complexity manufacturing environment. The machines are connected through an automated material handling device and in‐between buffer places that allow for autonomous production.
Koen Herps +3 more
wiley +1 more source
The one‐dimensional cutting stock problem with sequence‐dependent setups
Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva +3 more
wiley +1 more source
Two‐dimensional guillotine cutting problem for large objects with non‐rectangular shapes
Abstract In this paper, we address the two‐dimensional single large object placement problem with guillotine cutting constraints, focusing on non‐rectangular shapes. We consider objects with circular or convex polygonal geometries and study a variant that includes defective regions from which no items can be extracted. Rectangular items are cut using a
Carise E. Schmidt +3 more
wiley +1 more source
The quick growth of energy consumption in urban rail transit has drawn much attention due to the pressure of both operational cost and environmental responsibilities. In this paper, the timetable is optimized with respect to the system cost of urban rail
Huanhuan Lv +4 more
doaj +1 more source
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
The robust Mixed-Integer Linear Programming (MILP) model is an approach to address uncertainty in linear optimization involving integer and continuous variables, which can be solved using the Benders Decomposition method.
Fadiah Hasna Nadiatul Haq +2 more
doaj +1 more source

