A new extension of local search applied to the Dial-A-Ride Problem
| Autor: | Robert N. Moll, Patrick Healy |
|---|---|
| Rok vydání: | 1995 |
| Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Dial a ride business.industry Context (language use) Extension (predicate logic) Management Science and Operations Research 2-opt Travelling salesman problem Industrial and Manufacturing Engineering Modeling and Simulation Combinatorial optimization Local search (optimization) business Heuristics Mathematics |
| Zdroj: | European Journal of Operational Research. 83:83-104 |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/0377-2217(93)e0292-6 |
| Popis: | In this paper we propose a cheap yet effective extension to the traditional local improvement algorithm. We present this extension in the context of the Dial-A-Ride Problem, a variant of the Traveling Salesman Problem. This extension, which we call sacrificing , yields significant improvements over its plain local improvement counterpart without adversely affecting the algorithm's running time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect