Showing 1 - 10 of 56
We study a vehicle routing problem with soft time windows and stochastic travel times. In this problem, we consider …
Persistent link: https://www.econbiz.de/10011097851
We propose a constraint programming approach for the optimization of inventory routing in the liquefied natural gas …
Persistent link: https://www.econbiz.de/10011117485
The sales force deployment problem arises in many selling organizations. This complex planning problem involves the concurrent resolution of four interrelated subproblems: sizing of the sales force, sales representatives locations, sales territory alignment, and sales resource allocation. The...
Persistent link: https://www.econbiz.de/10011097827
In this paper we consider timetable design at a European freight railway operator. The timetable is designed by choosing the time of service for customer unit train demands among a set of discrete points. These discrete points are all found within the a time-window. The objective of the model is...
Persistent link: https://www.econbiz.de/10011077620
In this paper, we consider a multi-attribute vehicle routing problem derived from a real-life milk collection system …
Persistent link: https://www.econbiz.de/10011117460
In this paper, we extend the multiple traveling repairman problem by considering a limitation on the total distance that a vehicle can travel; the resulting problem is called the multiple traveling repairmen problem with distance constraints (MTRPD). In the MTRPD, a fleet of identical vehicles...
Persistent link: https://www.econbiz.de/10010871175
’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with …
Persistent link: https://www.econbiz.de/10010871199
In the m-Capacitated Peripatetic Salesman Problem (m-CPSP) the aim is to determine m Hamiltonian cycles of minimal total cost on a graph, such that all the edges are traversed less than the value of their capacity. This article introduces three formulations for the m-CPSP. Two branch-and-cut...
Persistent link: https://www.econbiz.de/10011052429
In the Distance Constrained Multiple Vehicle Traveling Purchaser Problem (DC-MVTPP) a fleet of vehicles is available to visit suppliers offering products at different prices and with different quantity availabilities. The DC-MVTPP consists in selecting a subset of suppliers so to satisfy...
Persistent link: https://www.econbiz.de/10010744226
We present a novel generic programming implementation of a column-generation algorithm for the generalized staff rostering problem. The problem is represented as a generalized set partitioning model, which is able to capture commonly occurring problem characteristics given in the literature....
Persistent link: https://www.econbiz.de/10010666133