1. //
  2. Start
  3. //
  4. Publikationen
  5. A guided simulated annealing search for ...
  6. Formate
  7. //

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

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung

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, Jahrgang 9, Nr. 4, 24.11.2006, S. 369-381.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung

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, Jg. 9, Nr. 4, S. 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

Zuletzt angesehen

Aktivitäten

  1. Coherent sets in nonautonomous dynamics
  2. SON 2020+2: International Workshop on Dynamics, Optimization, and Computation
  3. Social perceptiveness: Its role for performance in selection procedures and for the prediction of job performance
  4. Dealing with temporal tensions in drug development processes
  5. Machine vision system errors for unmanned aerial vehicle navigation
  6. THE EUROPEAN CONFERENCE ON MACHINE LEARNING & PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES 2017
  7. The many paths one picture can paint: Tracing a visual’s boundary work
  8. From Magic to Systemics. Heinz von Foerster and the Reenchantment of Science
  9. Enhancing EFL classroom instruction via an ICALL platform: effects on language development and transfer to tasks (EUROCALL)
  10. Do mathematics teachers promote the use of multiple representations in learning support situations? - Results from a video analysis.
  11. Learning and Re-learning in Chat-based CSCL: The Impact of Individual Learning Strategies
  12. Differentiating forest types using Terrasar-X spotlight images based on factor analysis
  13. Robotic Mobile Fulfillment Systems
  14. Micro and macro scale behavior of thermochemical materials in pure and composite forms for thermal storage applications
  15. Placemaking today: integrating place-oriented thinking into cultural policy frameworks

Publikationen

  1. Interaction-Dominant Causation in Mind and Brain, and Its Implication for Questions of Generalization and Replication
  2. A simple control strategy for increasing the soft bending actuator performance by using a pressure boost
  3. 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
  4. Mathematical relation between extended connectivity and eigenvector coefficients.
  5. Intraspecific trait variation patterns along a precipitation gradient in Mongolian rangelands
  6. Outperformed by a Computer? - Comparing Human Decisions to Reinforcement Learning Agents, Assigning Lot Sizes in a Learning Factory
  7. Artificial intelligence
  8. Early Detection of Faillure in Conveyor Chain Systems by Wireless Sensor Node
  9. A framework for business model development in technology-driven start-ups
  10. Collaborative open science as a way to reproducibility and new insights in primate cognition research
  11. Chapter 9: Particular Remedies for Non-performance: Section 1: Right to Performance
  12. Strengthening the transformative impulse while mainstreaming real-world labs: Lessons learned from three years of BaWü-Labs
  13. Design of an Information-Based Distributed Production Planning System
  14. The Impact of AGVs and Priority Rules in a Real Production Setup – A Simulation Study
  15. An intersection test for the cointegrating rank in dependent panel data
  16. Employing A-B tests for optimizing prices levels in e-commerce applications
  17. Machine Learning and Data Mining for Sports Analytics
  18. Effects of an expressive writing intervention (EWI) with women treated for breast cancer explored with recurrence quantification analysis (RQA) of changes in text structure - a proof-of-concept study
  19. Efficient co-regularised least squares regression
  20. Logistical Potentials of Load Balancing via the Build-up and Reduction of Stock
  21. The model of educational reconstruction: A framework for the design of theory-based content specific interventions
  22. A Column Generation Approach for Bus Driver Rostering Problems
  23. The Lifecycle of "Facts'': A Survey of Social Bias in Knowledge Graphs
  24. Graph-based Approaches for Analyzing Team Interaction on the Example of Soccer
  25. Segment Introduction
  26. A longitudinal multilevel CFA-MTMM model for interchangeable and structurally different methods
  27. A latent state-trait analysis of current achievement motivation across different tasks of cognitive ability
  28. Modellieren in der Sekundarstufe
  29. Comparison of Backpropagation and Kalman Filter-based Training for Neural Networks
  30. Hybrid models for future event prediction
  31. Optimization of a gaseous multitube detector for soft X-ray detection