Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research CrossRef

A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

European Journal of Operational Research , Volume 174 (2): 1117-1139 – Oct 1, 2006

A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

European Journal of Operational Research , Volume 174 (2): 1117-1139 – Oct 1, 2006

Loading next page...
 
/lp/crossref/a-fast-heuristic-for-solving-a-large-scale-static-dial-a-ride-problem-7VVaeCM8Kt

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0377-2217
DOI
10.1016/j.ejor.2004.09.060
Publisher site
See Article on Publisher Site

Abstract

Journal

European Journal of Operational ResearchCrossRef

Published: Oct 1, 2006

References