The design of robust value-creating supply chain networks: a critical review

W Klibi, A Martel, A Guitouni - European journal of operational research, 2010 - Elsevier
This paper discusses Supply Chain Network (SCN) design problem under uncertainty, and
presents a critical review of the optimization models proposed in the literature. Some …

A guide to vehicle routing heuristics

JF Cordeau, M Gendreau, G Laporte… - Journal of the …, 2002 - Taylor & Francis
A guide to vehicle routing heuristics Page 1 Journal of the Operational Research Society (2002)
53, 512–522 ©2002 Operational Research Society Ltd. All rights reserved. 0160-5682/02 $15.00 …

The Lagrangian relaxation method for solving integer programming problems

ML Fisher - Management science, 1981 - pubsonline.informs.org
One of the most computationally useful ideas of the 1970s is the observation that many hard
integer programming problems can be viewed as easy problems complicated by a relatively …

A generalized assignment heuristic for vehicle routing

ML Fisher, R Jaikumar - Networks, 1981 - Wiley Online Library
We consider a common variant of the vehicle routing problem in which a vehicle fleet
delivers products stored at a central depot to satisfy customer orders. Each vehicle has a …

The Lagrangian relaxation method for solving integer programming problems

ML Fisher - Management science, 2004 - pubsonline.informs.org
(This article originally appeared in Management Science, January 1981, Volume 27,
Number 1, pp. 1–18, published by The Institute of Management Sciences.) One of the most …

A genetic algorithm for the generalised assignment problem

PC Chu, JE Beasley - Computers & Operations Research, 1997 - Elsevier
In this paper we present a genetic algorithm (GA)-based heuristic for solving the generalised
assignment problem. The generalised assignment problem is the problem of finding the …

The school bus routing problem: A review

J Park, BI Kim - European Journal of operational research, 2010 - Elsevier
This paper aims to provide a comprehensive review of the school bus routing problem
(SBRP). SBRP seeks to plan an efficient schedule for a fleet of school buses where each …

[图书][B] Handbook of approximation algorithms and metaheuristics

TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

A survey of algorithms for the generalized assignment problem

DG Cattrysse, LN Van Wassenhove - European journal of operational …, 1992 - Elsevier
This paper surveys algorithms for the well-known problem of finding the minimum cost
assignment of jobs to agents so that each job is assigned exactly once and agents are not …

Urban freight transport using passenger rail network: Scientific issues and quantitative analysis

W Behiri, S Belmokhtar-Berraf, C Chu - Transportation Research Part E …, 2018 - Elsevier
This paper addresses a real-life problem arising in the ongoing “Grand Paris” project. We
investigate an environment-friendly urban freight transportation alternative using passenger …