Showing 51 - 60 of 72
Persistent link: https://www.econbiz.de/10014567005
Persistent link: https://www.econbiz.de/10013345610
Persistent link: https://www.econbiz.de/10012091814
The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage...
Persistent link: https://www.econbiz.de/10010861291
In an offshore wind farm (OWF), the turbines are connected to a transformer by cable routes that cannot cross each other. Finding the minimum cost array cable layout thus amounts to a vehicle routing problem with the additional constraints that the routes must be embedded in the plane. For this...
Persistent link: https://www.econbiz.de/10011153381
We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo sizes are defined by intervals instead of by fixed values. The flexible cargo sizes have...
Persistent link: https://www.econbiz.de/10005023428
In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on...
Persistent link: https://www.econbiz.de/10005626769
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling Salesman Problem with Time <p> Windows and to k-path cuts for...</p></p></p>
Persistent link: https://www.econbiz.de/10005802218
We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo sizes are defined by an interval instead of a fixed value. We show that the introduction of...
Persistent link: https://www.econbiz.de/10005802224
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence problem in order to make it solvable in...
Persistent link: https://www.econbiz.de/10005802227