loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Stefan Edelkamp and Max Gath

Affiliation: Institute for Artificial Intelligence and TZI - Center for Computing and Communication Technologies, Germany

ISBN: 978-989-758-015-4

Keyword(s): Nested Monte-Carlo Search, Single Vehicle Pickup and Delivery Problem (PDP), Traveling Salesman Problem (TSP), Routing and Scheduling Problems.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Machine Learning ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; State Space Search ; Symbolic Systems

Abstract: Transporting goods by courier and express services increases the service quality through short transit times and satisfies individual demands of customers. Determining the optimal route for a vehicle to satisfy transport requests while minimizing the total cost refers to the Single Vehicle Pickup and Delivery Problem. Beside time and distance objectives, in real world operations it is mandatory to consider further constraints such as time windows and the capacity of the vehicle. This paper presents a novel approach to solve Single Vehicle Pickup and Delivery Problems with time windows and capacity constraints by applying Nested Monte-Carlo Search (NMCS). NMCS is a randomized exploration technique which has successfully solved complex combinatorial search problems. To evaluate the approach, we apply benchmarks instances with up to 400 cities which have to be visited. The effects of varying the number of iterations and the search level are investigated. The results reveal, that the algo rithm computes state-of-the-art solutions and is competitive with other approaches. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.212.93.234

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Edelkamp S. and Gath M. (2014). Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search.In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-015-4, pages 22-33. DOI: 10.5220/0004722300220033

@conference{icaart14,
author={Stefan Edelkamp and Max Gath},
title={Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2014},
pages={22-33},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004722300220033},
isbn={978-989-758-015-4},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search
SN - 978-989-758-015-4
AU - Edelkamp S.
AU - Gath M.
PY - 2014
SP - 22
EP - 33
DO - 10.5220/0004722300220033

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.