Narrow search
Showing 1 - 10 of 145
Cover Image
Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach
Taş, D.; Gendreau, M.; Dellaert, N.; van Woensel, T.; … - In: European Journal of Operational Research 236 (2014) 3, pp. 789-799
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
Cover Image
Constraint programming for LNG ship scheduling and inventory management
Goel, V.; Slusky, M.; van Hoeve, W.-J.; Furman, K.C.; … - In: European Journal of Operational Research 241 (2015) 3, pp. 662-673
We propose a constraint programming approach for the optimization of inventory routing in the liquefied natural gas …
Persistent link: https://www.econbiz.de/10011117485
Cover Image
Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations
Mestry, Siddharth D; Centeno, Martha A; Faria, Jose A; … - 2010
The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer...
Persistent link: https://www.econbiz.de/10009460588
Cover Image
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
Degraeve, Z.; Jans, R.F. - Erasmus Research Institute of Management (ERIM), ERIM … - 2003
The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency. Imposingintegrality constraints on the variables in the full blown master will not necessarily give theoptimal IP solution as only...
Persistent link: https://www.econbiz.de/10005450993
Cover Image
Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
Haase, Knut; Müller, Sven - In: European Journal of Operational Research 237 (2014) 2, pp. 677-689
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
Cover Image
Freight railway operator timetabling and engine scheduling
Bach, Lukas; Gendreau, Michel; Wøhlk, Sanne - In: European Journal of Operational Research 241 (2015) 2, pp. 309-319
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
Cover Image
A column generation approach for a multi-attribute vehicle routing problem
Dayarian, Iman; Crainic, Teodor Gabriel; Gendreau, Michel; … - In: European Journal of Operational Research 241 (2015) 3, pp. 888-906
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
Cover Image
A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem
Meng, Qiang; Wang, Shuaian; Lee, Chung-Yee - In: Transportation Research Part B: Methodological 72 (2015) C, pp. 1-19
This paper deals with a practical tramp ship routing problem while taking into account different bunker prices at … different ports, which is called the joint tramp ship routing and bunkering (JSRB) problem. Given a set of cargoes to be … inefficient routing options. The B&P approach is tested with randomly generated large-scale instances derived from real …
Persistent link: https://www.econbiz.de/10011191174
Cover Image
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
Degraeve, Degraeve, Z.; Jans, Jans, R.F. - Erasmus Research Institute of Management (ERIM), … - 2003
The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency. Imposingintegrality constraints on the variables in the full blown master will not necessarily give theoptimal IP solution as only...
Persistent link: https://www.econbiz.de/10010731053
Cover Image
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong; Aneja, Y.P.; Huo, Jiazhen - In: Omega 40 (2012) 5, pp. 672-679
We present node-arc and arc-path formulations, and develop a branch-and-price approach for the directed network design problem with relays (DNDR). The DNDR problem can be used to model many network design problems in transportation, service, and telecommunication system, where relay points are...
Persistent link: https://www.econbiz.de/10010870971