Sciweavers

146 search results - page 11 / 30
» Vehicle routing and scheduling with dynamic travel times
Sort
View
CP
1998
Springer
14 years 5 days ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
VLDB
2002
ACM
198views Database» more  VLDB 2002»
13 years 7 months ago
A New Passenger Support System for Public Transport using Mobile Database Access
We have been developing a mobile passenger support system for public transport. Passengers can make their travel plans and purchase necessary tickets by accessing databases via th...
Koichi Goto, Yahiko Kambayashi
ANOR
2008
171views more  ANOR 2008»
13 years 8 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
COR
2000
129views more  COR 2000»
13 years 7 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
TRANSCI
2010
80views more  TRANSCI 2010»
13 years 6 months ago
Congestion Pricing for Schedule-Based Transit Networks
In this paper, we develop models for adjusting or setting fares on a transit system to encourage passengers to choose travel strategies that lead to the least travel delay for the...
Younes Hamdouch, Siriphong Lawphongpanich