(Enter summary)
Abstract: We propose local search algorithms for the vehicle routing problem with soft time
window constraints. The time window constraint for each customer is treated as a penalty
function, which is very general in the sense that it can be non-convex and discontinuous as
long as it is piecewise linear. The generality of time window constraints allows us to handle
a wide variety of scheduling problems. As such an example, we mention in this paper an
application to a production scheduling problem with... (Update)
Similar documents based on text: More All
0.9: Sequencing With Earliness And Tardiness Penalties - Tütüncüoglu (1999)
(Correct)
0.5: Eective Local Search Algorithms for the Vehicle.. - Constraints Toshihide .. (2001)
(Correct)
0.3: The Life Span Method - A New Variant of Local Search - - Kubo, Fujisawa (1997)
(Correct)
BibTeX entry: (Update)
Ibaraki, T., Kubo, M., Masuda, T., Uno, T., and Yagiura, M., Effective local search algorithms for the vehicle routing problem with general time windows, Working paper, Department of Applied Mathematics and Physics, Kyoto University, Japan, (2001). http://citeseer.ist.psu.edu/ibaraki02effective.html More
@misc{ ibaraki01effective,
author = "T. Ibaraki and M. Kubo and T. Masuda and T. Uno and M. Yagiura",
title = "Effective local search algorithms for the vehicle routing problem with
general time windows",
text = "Ibaraki, T., Kubo, M., Masuda, T., Uno, T., and Yagiura, M., Effective
local search algorithms for the vehicle routing problem with general time
windows, Working paper, Department of Applied Mathematics and Physics, Kyoto
University, Japan, (2001).",
year = "2001",
url = "citeseer.ist.psu.edu/ibaraki02effective.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
461
Nonlinear Programming (context) - Bertsekas - 1995
102
Computer solutions of the traveling salesman problem (context) - Lin - 1965
98
Local optimization and the traveling salesman problem (context) - Johnson - 1990
79
A new adaptive multi-start technique for combinatorial globa.. (context) - Boese, Kahng et al. - 1994
63
Linear Programming (context) - Chv - 1983
62
Large-step Markov chains for the traveling salesman problem
- Martin, Otto et al. - 1991
52
Large-step Markov chains for the TSP incorporating local sea..
- Martin, Otto et al. - 1992
42
The traveling salesman problem: a case study (context) - Johnson, McGeoch - 1997
41
ective heuristic algorithm for the traveling salesman proble.. (context) - Lin, Kernighan - 1973
23
A tabu search heuristic for the vehicle routing problem with.. (context) - Taillard, Badeau et al. - 1997
22
Time window constrained routing and scheduling problems (context) - Solomon, Desrosiers - 1988
17
Vehicle routing with time windows: optimization and approxim.. (context) - Desrochers, Lenstra et al. - 1988
16
Traveling Salesman-Type Combinatorial Problems and Their Rel.. (context) - Or - 1976
13
The vehicle routing problem with time windows: minimizing ro.. (context) - Savelsbergh - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www-or.amp.i.kyoto-u.ac.jp/members/yagiura/papers-e.html): More
The Use of Dynamic Programming in Genetic Algorithms for.. - Yagiura, IBARAKI (1996)
(Correct)
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the .. - Yagiura, Ibaraki (1998)
(Correct)
An Ejection Chain Approach for the Generalized Assignment.. - Yagiura, Ibaraki, Glover (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC