Similar Search Results

A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs

Melechovsky 4, Jan; Prins, Christian; Calvo, Roberto Wolfler - In: Journal of heuristics 11 (2005) 5, pp. 375-392

Persistent link: https://www.econbiz.de/10008213994

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

Prins, Christian; Prodhon, Caroline; Calvo, Roberto Wolfler - 2006

Persistent link: https://www.econbiz.de/10008222361

Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

Prins, Christian; Prodhon, Caroline; Ruiz, Angel; … - In: Transportation science : the publication of the … 41 (2007) 4, pp. 470-483

Persistent link: https://www.econbiz.de/10007872841

New Lower Bounds and Exact Method for the m-PVRP

Ngueveu, Sandra Ulrich; Prins, Christian; Wolfler … - In: Transportation science : the publication of the … 47 (2013) 1, pp. 38-52

Persistent link: https://www.econbiz.de/10010072285

A Heuristic for the Vehicle Routing Problem with Time Windows

Cordone, Roberto; Calvo, Roberto Wolfler - In: Journal of heuristics 7 (2001) 2, pp. 107-130

Persistent link: https://www.econbiz.de/10008217169

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

Baldacci, Roberto; Mingozzi, Aristide; Roberti, Roberto; … - In: Operations research : the journal of the Operations … 61 (2013) 2, pp. 298-314

Persistent link: https://www.econbiz.de/10010104448

A New Heuristic for the Traveling Salesman Problem with Time Windows

Calvo, Roberto Wolfler - In: Transportation science : the publication of the … 34 (2000) 1, pp. 113-124

Persistent link: https://www.econbiz.de/10006456198

Competitive genetic algorithms for the open-shop scheduling problem

Prins, Christian - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 389-411

For more than two machines, and when preemption is forbidden, the computation of minimum makespan schedules for the open-shop problem is NP-hard. Compared to the flow-shop and the job-shop, the open-shop has free job routes which lead to a much larger solution space, to smaller gaps between the...

Persistent link: https://www.econbiz.de/10010999896

Classical and new heuristics for the open-shop problem: A computational evaluation

Gueret, Christelle; Prins, Christian - In: European Journal of Operational Research 107 (1998) 2, pp. 306-314

Persistent link: https://www.econbiz.de/10005240648

Evolutionary algorithms for periodic arc routing problems

Lacomme, Philippe; Prins, Christian; Ramdane-Cherif, Wahiba - In: European Journal of Operational Research 165 (2005) 2, pp. 535-553

Persistent link: https://www.econbiz.de/10005337746