1. //
  2. Start
  3. //
  4. Publications
  5. A guided simulated annealing search for ...
  6. Output formats
  7. //

A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints

Research output: Journal contributions › Journal articles › Research

Standard

A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints. / Urban, Karsten-Patrick.
In: International Journal of Logistics, Vol. 9, No. 4, 24.11.2006, p. 369-381.

Research output: Journal contributions › Journal articles › Research

Harvard

Urban, K-P 2006, 'A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints', International Journal of Logistics, vol. 9, no. 4, pp. 369-381. https://doi.org/10.1080/13675560600931521

APA

Urban, K.-P. (2006). A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints. International Journal of Logistics, 9(4), 369-381. https://doi.org/10.1080/13675560600931521

Vancouver

Urban KP. A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints. International Journal of Logistics. 2006 Nov 24;9(4):369-381. doi: 10.1080/13675560600931521

Bibtex

@article{c7f9f05d1e624a83a373a80d727cb3a6,
title = "A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints",
abstract = "Routing and scheduling requests with pick-ups and deliveries is still one of the greatest operative challenges in inter-company logistics. Pick-up and delivery activities have to be bundled into efficient routes and their sequence has to be optimised within the routes without violating time and capacity constraints. The objective is to find a schedule of routes with minimal total costs. These costs result from the arising travelling costs, costs due to waiting and service times, and due to dispatching vehicles. This paper presents a guided local search method based on simulated annealing for solving this kind of routing and scheduling problem. Additionally, a new more realistic objective function that covers the total decision-relevant costs is introduced. The computational results show that the algorithm presented clearly outperforms standard implementations of simulated annealing and hill climber search.",
keywords = "Management studies, Applying non-linear cost functions in combinatorial optimisation, Guided neighbourhood search, Metaheuristics, Pick-up and delivery problem, Simulated annealing",
author = "Karsten-Patrick Urban",
note = "Publisher Copyright: {\textcopyright} 2006, Copyright Taylor & Francis Group, LLC.",
year = "2006",
month = nov,
day = "24",
doi = "10.1080/13675560600931521",
language = "English",
volume = "9",
pages = "369--381",
journal = "International Journal of Logistics",
issn = "1367-5567",
publisher = "Taylor and Francis Ltd.",
number = "4",

}

RIS

TY - JOUR

T1 - A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints

AU - Urban, Karsten-Patrick

N1 - Publisher Copyright: © 2006, Copyright Taylor & Francis Group, LLC.

PY - 2006/11/24

Y1 - 2006/11/24

N2 - Routing and scheduling requests with pick-ups and deliveries is still one of the greatest operative challenges in inter-company logistics. Pick-up and delivery activities have to be bundled into efficient routes and their sequence has to be optimised within the routes without violating time and capacity constraints. The objective is to find a schedule of routes with minimal total costs. These costs result from the arising travelling costs, costs due to waiting and service times, and due to dispatching vehicles. This paper presents a guided local search method based on simulated annealing for solving this kind of routing and scheduling problem. Additionally, a new more realistic objective function that covers the total decision-relevant costs is introduced. The computational results show that the algorithm presented clearly outperforms standard implementations of simulated annealing and hill climber search.

AB - Routing and scheduling requests with pick-ups and deliveries is still one of the greatest operative challenges in inter-company logistics. Pick-up and delivery activities have to be bundled into efficient routes and their sequence has to be optimised within the routes without violating time and capacity constraints. The objective is to find a schedule of routes with minimal total costs. These costs result from the arising travelling costs, costs due to waiting and service times, and due to dispatching vehicles. This paper presents a guided local search method based on simulated annealing for solving this kind of routing and scheduling problem. Additionally, a new more realistic objective function that covers the total decision-relevant costs is introduced. The computational results show that the algorithm presented clearly outperforms standard implementations of simulated annealing and hill climber search.

KW - Management studies

KW - Applying non-linear cost functions in combinatorial optimisation

KW - Guided neighbourhood search

KW - Metaheuristics

KW - Pick-up and delivery problem

KW - Simulated annealing

UR - https://www.mendeley.com/catalogue/86bfab48-6499-399b-ac28-0c40a06a0878/

UR - http://www.scopus.com/inward/record.url?scp=84901642165&partnerID=8YFLogxK

U2 - 10.1080/13675560600931521

DO - 10.1080/13675560600931521

M3 - Journal articles

VL - 9

SP - 369

EP - 381

JO - International Journal of Logistics

JF - International Journal of Logistics

SN - 1367-5567

IS - 4

ER -

DOI

Recently viewed

Activities

  1. Quality of reading instruction in language classrooms: Subject specific analysis of teaching quality
  2. Reflexive Multi-Criteria Evaluation as a Tool to Integrate Multiple Values of Scientists and Stakeholders
  3. Improving Production Scheduling with Machine Learning
  4. Fuzzy based control of a nonholonomic car-like robot for drive assistant systems
  5. Performativity and Authenticity in the Web 2.0-Enhanced Foreign Language Classroom
  6. The implementation of formative assessment in inclusive mathematics instruction
  7. Presentation of the paper entitled: "Controlling a Bank Model Economy by Using an Adaptive Model Predictive Control with Help of an Extended Kalman Filter"
  8. Concurrent Adaptive Tests for Formative Assessments in School Classes
  9. Material Migrations I Online Lecture Series
  10. Exploring Affective Human-Robot Interaction with Movie Scenes
  11. Implementing aspects of inquiry-based learning in secondary chemistry classes: a case study
  12. Maximum-Likelihood-Based Panel Cointegration Test with Linear Time Trend

Publications

  1. Species composition and forest structure explain the temperature sensitivity patterns of productivity in temperate forests
  2. Harvesting information from captions for weakly supervised semantic segmentation
  3. Analysis And Comparison Of Dispatching RuleBased Scheduling In Dual-Resource Constrained Shop-Floor Scenarios
  4. Taking the pulse of Earth's tropical forests using networks of highly distributed plots
  5. Hierarchical trait filtering at different spatial scales determines beetle assemblages in deadwood
  6. Dynamic Lot Size Optimization with Reinforcement Learning
  7. Use of Machine-Learning Algorithms Based on Text, Audio and Video Data in the Prediction of Anxiety and Post-Traumatic Stress in General and Clinical Populations
  8. Comparison of different FEM codes approach for extrusion process analysis
  9. Towards a spatial understanding of identity play
  10. Global Finite-Time Stabilization of Planar Linear Systems With Actuator Saturation
  11. Effectiveness of a guided multicomponent internet and mobile gratitude training program - A pragmatic randomized controlled trial
  12. Sensor Fusion for Power Line Sensitive Monitoring and Load State Estimation
  13. Clause identification using entropy guided transformation learning
  14. Experimentally established correlation of friction surfacing process temperature and deposit geometry
  15. Constraints are the solution, not the problem
  16. Segment Introduction
  17. Understanding storytelling in the context of information systems
  18. The signal location task as a method quantifying the distribution of attention
  19. Universal Threshold Calculation for Fingerprinting Decoders using Mixture Models
  20. Real-time RDF extraction from unstructured data streams
  21. Age effects on controlling tools with sensorimotor transformations
  22. Supporting the Development and Realization of Data-Driven Business Models with Enterprise Architecture Modeling and Management
  23. Computing regression statistics from grouped data
  24. A localized boundary element method for the floating body problem
  25. On the Decoupling and Output Functional Controllability of Robotic Manipulation
  26. Analysis of PI controllers with anti-windup techniques on level systems
  27. Image compression based on periodic principal components
  28. TRY plant trait database – enhanced coverage and open access
  29. A Review of Latent Variable Modeling Using R - A Step-by-Step-Guide
  30. Knowledge-Enhanced Language Models Are Not Bias-Proof
  31. An Orthogonal Wavelet Denoising Algorithm for Surface Images of Atomic Force Microscopy