Variable neighbourhood search in commercial VRP packages
|
|
|
- Noreen Cunningham
- 6 years ago
- Views:
Transcription
1 in commercial VRP packages Evolving towards self-adaptive methods Kenneth Sörensen 1 Marc Sevaux 2 Patrick Schittekat 3 1 Centre for Industrial Management, KULeuven, Belgium, kenneth.sorensen@cib.kuleuven.be 2 University of South Brittany, France 3 University of Antwerp & Ortec, Belgium 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics University of Málaga, Spain November, 2006 in commercial VRP packages
2 1 Real-life vehicle routing 2 VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability 3 in commercial VRP packages
3 Real-life vehicle routing On vehicle routing in industry Vehicle routing is very important in industry Real-life vehicle routing problems are several orders of magnitude more complex than their academic counterparts Commercial packages are popular, stand-alone or integrated To be useful, commercial packages must capture many real-life aspects This talk: Commercial vehicle routing solvers use Variable Neighbourhood Search For commercial VRP packages, adaptiveness is paramount in commercial VRP packages
4 Vehicle routing in theory Problem well-defined and in advance Limited set of constraints, usually only one at a time Exact methods may be used to a large extent Increasing focus on rich vehicle routing problems in commercial VRP packages
5 Vehicle routing problems encountered in practice Customer characteristics Driver characteristics Vehicle characteristics Route characteristics General characteristics in commercial VRP packages
6 Vehicle routing problems encountered in practice Customer characteristics time windows (soft/hard) pick-up/delivery/both special driver or vehicle requirements... Driver characteristics Vehicle characteristics Route characteristics General characteristics in commercial VRP packages
7 Vehicle routing problems encountered in practice Customer characteristics Driver characteristics hours available required resting times ability to drive some vehicles and others not legal regulations... Vehicle characteristics Route characteristics General characteristics in commercial VRP packages
8 Vehicle routing problems encountered in practice Customer characteristics Driver characteristics Vehicle characteristics heterogeneous fleet (different types/sizes of vehicles) multiple compartments (e.g. cooling, freezing,... ) special equipment (cranes, loading equipment,... ) varying start/end locations special licence required different cost structures... Route characteristics General characteristics in commercial VRP packages
9 Vehicle routing problems encountered in practice Customer characteristics Driver characteristics Vehicle characteristics Route characteristics time-dependent travel time (e.g. longer during rush hours) ability to traverse certain routes or make certain turns... General characteristics in commercial VRP packages
10 Vehicle routing problems encountered in practice Customer characteristics Driver characteristics Vehicle characteristics Route characteristics General characteristics non-standard different routing problems (buses, taxis, garbage collector cars, transport of disabled people,... ) multiple heterogeneous depots (e.g. carrying different products and having different stock levels for each product) stochasticity dynamic information objective function (cost, balance between route lengths,... )... in commercial VRP packages
11 Vehicle routing in practice in commercial VRP packages
12 ORMS vehicle routing survey Vehicle routing packages are used in a wide variety of environments Integration with ERP systems is important Specialization may be a good idea Size and complexity of real-life VRPs requires (meta)heuristics in commercial VRP packages
13 Variable Neighbourhood Search VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability Systematically explore different neighbourhood types Increasingly succesful and popular metaheuristic Some applications to academic routing problems All commercial routing packages use it in commercial VRP packages
14 Variable Neighbourhood Search VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability Systematically explore different neighbourhood types Increasingly succesful and popular metaheuristic Some applications to academic routing problems All commercial routing packages use it Why? in commercial VRP packages
15 VNS in commercial VRP solvers VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability Techniques frequently used Construction heuristics (savings, clustering,...) Manipulate stops within one route Manipulate stops between routes Manipulate routes between vehicles Equalize route lengths... Techniques hardly ever used Memory structures Random perturbations Path relinking Crossover/mutation... in commercial VRP packages
16 VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability VNS in commercial VRP solvers: why? Overcoming the myopic behaviour of a single neighbourhood in commercial VRP packages
17 VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability VNS in commercial VRP solvers: why? Overcoming the myopic behaviour of a single neighbourhood in commercial VRP packages
18 VNS in commercial solvers Overcoming myopic behaviour Flexibility and adaptability VNS in commercial VRP solvers: why? Flexibility and adaptability Different problems require different approaches Developing a new method for each customer is intractable Applications can be adapted by re-arranging the neighbourhood order and frequency Some neighbourhoods operators are better suited for some problems than others Neighbourhood operators are components that may be reused Drawback: requires lots of manual intervention from expensive consultants in commercial VRP packages
19 Self-adaptive VRP solvers VRP solvers need to become self-adaptive Hyper-algorithm to determine optimal solver configuration One parameter: expected solution time On-line During optimization Based on actual problem data Best-suited for long optimization times Off-line Before actual optimization Based on benchmark historical data Best-suited for short optimization times Promising research area: hyper-heuristicss Important knowledge: what makes this VRP difficult? in commercial VRP packages
20 Conclusions Vehicle routing in industry is much more complex than in theory All commercial VRP solvers use some form of VNS Overcoming myopic behaviour of single neighbourhood Flexibility and adaptability There is a strong need for self-adaptive systems BUT: knowledge of problem structure is required What makes a specific VRP hard? Lots more research is needed in this area in commercial VRP packages
21 in commercial VRP packages Evolving towards self-adaptive methods Kenneth Sörensen 1 Marc Sevaux 2 Patrick Schittekat 3 1 Centre for Industrial Management, KULeuven, Belgium, kenneth.sorensen@cib.kuleuven.be 2 University of South Brittany, France 3 University of Antwerp & Ortec, Belgium 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics University of Málaga, Spain November, 2006 in commercial VRP packages
A metaheuristic for solving large instances of the School Bus Routing Problem
instances of the Patrick Schittekat Marc Sevaux Kenneth Sörensen Johan Springael ORTEC / University of Antwerp, Belgium patrick.schittekat@ua.ac.be University of Leuven, Belgium kenneth.sorensen@cib.kuleuven.be
Scheduling and routing problems at TNT
Some solutions and some future research directions K. Sörensen 1 J. Vandenbergh 1 D. Cattrysse 1 M. Sevaux 2 1 Centre for Industrial Management, KULeuven {kenneth.sorensen, joos.vandenbergh, dirk.cattrysse}@cib.kuleuven.be
A HEURISTIC FOR THE SOLUTION OF VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND MULTIPLE DUMPING SITES IN WASTE COLLECTION
A HEURISTIC FOR THE SOLUTION OF VEHICLE, University of Applied Sciences Merseburg, Germany 1 Problem statement 2 A cluster first route second approach 2.1 A capacitated k-means algorithm 2.2 A capacitated
Biobjective Inventory Routing Problem
Biobjective Inventory Routing Problem problem solution and decision support Martin Josef Geiger 1 Marc Sevaux 1,2 m.j.geiger@hsu-hh.de marc.sevaux@univ-ubs.fr 1 Helmut Schmidt University Logistic Management
Pro-active Dynamic Vehicle Routing
Francesco Ferrucci Pro-active Dynamic Vehicle Routing Real-Time Control and Request-Forecasting Approaches to Improve Customer Service Physica-Verlag A Springer Company Introduction 1 1.1 Motivation 3
Use of Genetic Algorithms in Discrete Optimalization Problems
Use of Genetic Algorithms in Discrete Optimalization Problems Alena Rybičková supervisor: Ing. Denisa Mocková PhD Faculty of Transportation Sciences Main goals: design of genetic algorithm for vehicle
A Process Oriented Modeling Concept for Rich Vehicle Routing Problems
Collaborative Research Center SFB559 Modeling of Large Logistic Networks Computer Science Algorithm Engineering A Process Oriented Modeling Concept for Rich Vehicle Routing Problems Andreas Reinholz VIP
An Exact Solution for a Class of Green Vehicle Routing Problem
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 An Exact Solution for a Class of Green Vehicle Routing Problem Mandy
A Simheuristic for the Waste Collection Problem with Stochastic Demands in Smart Cities
Simulation in Production and Logistics 2015 Markus Rabe & Uwe Clausen (eds.) Fraunhofer IRB Verlag, Stuttgart 2015 A Simheuristic for the Waste Collection Problem with Stochastic Demands in Smart Cities
SIMULATION MODEL FOR IRP IN PETROL STATION REPLENISHMENT
SIMULATION MODEL FOR IRP IN PETROL STATION REPLENISHMENT Dražen Popović a,*, Milorad Vidović a, Nenad Bjelić a a University of Belgrade, Faculty of Transport and Traffic Engineering, Department of Logistics,
Multi-Period Vehicle Routing with Call-In Customers
Multi-Period Vehicle Routing with Call-In Customers Anirudh Subramanyam, Chrysanthos E. Gounaris Carnegie Mellon University Frank Mufalli, Jose M. Pinto Praxair Inc. EWO Meeting September 30 th October
VRPTW with Multiple Service Workers
VRPTW with Multiple Service Workers Route construction heuristics Gerald Senarclens de Grancy (gerald@senarclens.eu), Marc Reimann (marc.reimann@uni graz.at) Outline 1. Problem Background and Motivation
Hours of service regulations in road freight transport: an optimization-based international assessment. Thibaut Vidal
Hours of service regulations in road freight transport: an optimization-based international assessment Thibaut Vidal Seminar, Universidade Federal Fluminense, March 15 th, 2013 Context of this research
A New Rich Vehicle Routing Problem Model and Benchmark Resource
A New Rich Vehicle Routing Problem Model and Benchmark Resource Kevin Sim*, Emma Hart, Neil Urquhart Centre for Algorithms, Visualisation and Evolving Systems Edinburgh Napier University, Merchiston Campus,
A Tabu Search Heuristic for the Inventory Routing Problem
A Tabu Search Heuristic for the Inventory Routing Problem Karine Cousineau-Ouimet, Department of Quantitative Methods École des Hautes Études Commerciales Montreal, Canada mailto:karine.cousineau-ouimet@hec.ca
Last mile logistics optimization for e-commerce. Luc Kremers, Director ORTEC Asia
Last mile logistics optimization for e-commerce Luc Kremers, Director ORTEC Asia About ORTEC SCM Optimization experts 35 years existence North America USA South America Brazil Western Europe Belgium France
weather monitoring, forest fire detection, traffic control, emergency search and rescue A.y. 2018/19
UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted) Historically, used in the military, mainly deployed in hostile territory to reduce pilot
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem Rodrigo Lankaites Pinheiro, Dario Landa-Silva, and Jason Atkin School of Computer Science, ASAP Research Group The University
Cover Page. Author: Zhiwei Yang Title: Meta-heuristics for vehicle routing and inventory routing problems Issue Date:
Cover Page The handle http://hdl.handle.net/1887/43073 holds various files of this Leiden University dissertation Author: Zhiwei Yang Title: Meta-heuristics for vehicle routing and inventory routing problems
Lower Bounds for the Two-Echelon Vehicle Routing Problem
Lower Bounds for the Two-Echelon Vehicle Routing Problem Teodor Gabriel Crainic Simona Mancini Guido Perboli Roberto Tadei Département de management et technologie, Ecole des sciences de la gestion and
Transactions on the Built Environment vol 33, 1998 WIT Press, ISSN
Effects of designated time on pickup/delivery truck routing and scheduling E. Taniguchf, T. Yamada\ M. Tamaishi*, M. Noritake^ "Department of Civil Engineering, Kyoto University, Yoshidahonmachi, Sakyo-kyu,
Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands
Fundamenta Informaticae 71(1) (2006) 27 36 27 IOS Press Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands Jaroslaw Koźlak Department of
Modeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
Guy Desaulniers Eric Prescott Gagnon Louis Martin Rousseau Ecole Polytechnique, Montreal
Guy Desaulniers Eric Prescott Gagnon Louis Martin Rousseau Ecole Polytechnique, Montreal 1 Introduction Vehicle routing problem with time windows Motivation Large neighborhood search Hybrid LNS and Column
A Vehicle Routing in Glass Waste Collection
A Tino Henke, M. Grazia Speranza, Gerhard Wäscher University of Magdeburg, Germany University of Brescia, Italy Clausthal-Zellerfeld, May Introduction and Motivation A Glass Waste Collection Problem Introduction
Proceedings of the 2016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds.
Proceedings of the 2016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds. COMBINING MONTE CARLO SIMULATION WITH HEURISTICS TO SOLVE A
Artificial Intelligence Computational Techniques to Optimize a Multi Objective Oriented Distribution Operations
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaa, Bangladesh, January 9 10, 2010 Artificial Intelligence Computational Techniques to Optimize a
Integrated Location Routing and Scheduling Problems
Integrated Location Routing and Scheduling Problems Zeliha Akça zelihaakca@lehigh.edu Rosemary T. Berger rosemary.berger@verizon.net Theodore K. Ralphs tkr2@lehigh.edu Department of Industrial and Systems
Procedia - Social and Behavioral Sciences 109 ( 2014 ) Selection and peer review under responsibility of Organizing Committee of BEM 2013.
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Sciences 109 ( 2014 ) 779 783 2 nd World Conference On Business, Economics And Management-WCBEM 2013 A hybrid metaheuristic
ISE480 Sequencing and Scheduling
ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for
Company presentation. dr. ir. Steven De Schrijver dr. An De Wispelaere. business partner
Company presentation dr. ir. Steven De Schrijver dr. An De Wispelaere business partner 1 We want to amaze you with our insights in your business. By controlling your complexity we will help you realize
ArcGIS Network Analysis Solving transportation problems
Route Closest Facility Service Area ArcGIS Network Analysis Solving transportation problems Location-Allocation Vehicle Routing Problem Origin-Destination Cost Matrix Where do you get street data? Included
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael S. Sanders, Jr. Computer Systems Lab, 2008-2009 Thomas Jefferson High School for Science and Technology Alexandria, Virginia
Multi-Period Vehicle Routing with Stochastic Customers
Multi-Period Vehicle Routing with Stochastic Customers Anirudh Subramanyam, Chrysanthos E. Gounaris Frank Mufalli, Jose M. Pinto EWO Spring Meeting March 9, 2016 1 Tactical Planning in Vehicle Routing
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows 2 Jean-Charles Créput 1, Abder Koukam 1, Jaroslaw Kozlak 1,2, and Jan Lukasik 1,2 1 University of Technology of Belfort-Montbeliard,
Dynamic Vehicle Routing and Dispatching
Dynamic Vehicle Routing and Dispatching Jean-Yves Potvin Département d informatique et recherche opérationnelle and Centre interuniversitaire de recherche sur les réseaux d entreprise, la logistique et
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications Dimitris Bertsimas, Patrick Jaillet, Sébastien Martin Operations Research Center, Massachusetts Institute of Technology March
Hybrid approaches to the Repositioning Problem in Bicycle-Sharing Systems
Hybrid approaches to the Repositioning Problem in Bicycle-Sharing Systems Juan David Palacio Domínguez PhD Student in Mathematical Engineering Juan Carlos Rivera Agudelo Thesis Advisor Doctoral Seminar
Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes
Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Thibaut VIDAL LOSI et CIRRELT Université de Technologie de Troyes et Université
High-performance local search for solving real-life inventory routing problems
High-performance local search for solving real-life inventory routing problems Thierry Benoist 1, Bertrand Estellon 2, Frédéric Gardi 1, Antoine Jeanjean 1 1 Bouygues e-lab, Paris, France 2 Laboratoire
Metaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example.
Metaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example Amina Lamghari COSMO Stochastic Mine Planning Laboratory! Department
Descartes WinRoute TM. Release 7.5 Release Notes
Descartes WinRoute TM Release 7.5 Release Notes Table of Contents Release Summary... 3 Enhancement 1: Connection to wgln... 3 Enhancement 2: Toll & Tax Roads... 4 Enhancement 3: Work Load Balancing...
EFFICIENT VEHICLE ROUTING PROBLEM: A SURVEY
REVIEW ARTICLE ISSN: 2321-7758 EFFICIENT VEHICLE ROUTING PROBLEM: A SURVEY V.PRAVEEN 1, V.HEMALATHA 2, K.JOTHIMANI 3, M.POOVIZHI 4, V.GOBU 5 1, 2, 3,4&5 Assistant Professor, CSE, N.S.N College of Engineering
Branch-and-Price for Vehicle Routing Problems with Multiple Synchronization Constraints
Branch-and-Price for Vehicle Routing Problems with Multiple Synchronization Constraints Michael Drexl Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University
The Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Burke, Edmund and Eckersley, Adam and McCollum, Barry and Sanja, Petrovic and Qu, Rong (2003) Using Simulated Annealing to Study Behaviour of Various Exam Timetabling Data Sets. In: The Fifth Metaheuristics
Vehicle Routing with Departure Smoothing
ERASMUS UNIVERSITY ROTTERDAM Erasmus School of Economics Vehicle Routing with Departure Smoothing Master s Thesis Econometrics and Management Science Author: N.M. van der Zon Student ID: 387441 Supervisors:
AN ANT COLONY APPROACH TO SOLVE A VEHICLE ROUTING PROBLEM IN A FMCG COMPANY SRINIVAS RAO T & PRAKASH MARIMUTHU K
International Journal of Mechanical and Production Engineering Research and Development (IJMPERD) ISSN(P): 2249-6890; ISSN(E): 2249-8001 Vol. 8, Issue 1 Feb 2018, 1113-1118 TJPRC Pvt. Ltd. AN ANT COLONY
UNMANNED AERIAL VEHICLES (UAVS)
UNMANNED AERIAL VEHICLES (UAVS) MONITORING BY UAVS I.E. WHAT? (SOME THESES PROPOSALS) UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted)
Simulated Annealing Algorithm for Vehicle Routing Problem with Transshipment
Simulated Annealing Algorithm for Vehicle Routing Problem with Transshipment Sukanya Thonethong #1, Jirachai Buddhakulsomsiri #2 # Logistics and Supply Chain Systems Engineering Sirindhorn International
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests Pandhapon Sombuntham a and Voratas Kachitvichyanukul b ab Industrial and Manufacturing Engineering, Asian Institute of Technology,
INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN
INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN Farshad Farshchi Department of Industrial Engineering, Parand Branch, Islamic Azad University, Parand, Iran Davood Jafari Department of Industrial
Rich Vehicle Routing in Theory and Practice
Rich Vehicle Routing in Theory and Practice Technical Report LM-2011-04 Michael Drexl Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz and
Vendor Managed Inventory vs. Order Based Fulfillment in a. Specialty Chemical Company
Vendor Managed Inventory vs. Order Based Fulfillment in a Specialty Chemical Company Introduction By Dimitrios Andritsos and Anthony Craig Bulk chemicals manufacturers are considering the implementation
Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery
Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery Suttinee Sawadsitang, Rakpong Kaewpuang, Siwei Jiang, Dusit Niyato, Ping Wang School of Computer Science and Engineering,
MICRO-SIMULATION OF A NIGHT TAXI-BUS SERVICE FOR THE HISTORICAL CENTRE OF ROME
MICRO-SIMULATION OF A NIGHT TAXI-BUS SERVICE FOR THE HISTORICAL CENTRE OF ROME Francesco Filippi 1), Marco Lemessi 2) and Thomas Schulze 3) Abstract: The Municipality of Rome plans to introduce a taxi-bus
Routing in maritime logistics
Routing in maritime logistics Truls Flatberg and Oddvar Kloster SINTEF 1 Outline Maritime routing Pickup and delivery variations Free delivery location Predefined number of visits Inter arrival gap Generic
The Livestock Collection Problem
The Livestock Collection Problem Johan Oppen, Arne Løkketangen Molde University College 6402 Molde, Norway Email: Johan.Oppen@hiMolde.no Arne.Lokketangen@hiMolde.no Abstract We present a problem dealing
Development of a Simheuristic Approach for Solving Realistic Inventory Routing Problems
Simulation in Production and Logistics 2015 Markus Rabe & Uwe Clausen (eds.) Fraunhofer IRB Verlag, Stuttgart 2015 Development of a Simheuristic Approach for Solving Realistic Inventory Routing Problems
Stochastic and Dynamic Patient Transportation
Stochastic and Dynamic Patient Transportation Ulrike Ritzinger 1 Jakob Puchinger 1 Richard F. Hartl 2 1 Mobility Department Austrian Institute of Technology 2 Department of Business Administration University
Dynamic Vehicle Routing: State-of-the-art and some Research Perspectives
Dynamic Vehicle Routing: State-of-the-art and some Research Perspectives Michel Gendreau CIRRELT and MAGI Polytechnique Montréal EPFL Lausanne, Suisse July 20, 2016 Acknowledgements The work described
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
Strategies for Coordinated Drayage Movements
Strategies for Coordinated Drayage Movements Christopher Neuman and Karen Smilowitz May 9, 2002 Abstract The movement of loaded and empty equipment (trailers and containers) between rail yards and shippers/consignees
Spatial Information in Offline Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests
1 Spatial Information in Offline Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests Ansmann, Artur, TU Braunschweig, a.ansmann@tu-braunschweig.de Ulmer, Marlin W., TU
Spatial decision support system for milk collection
Ref: C0543 Spatial decision support system for milk collection Javier Bueno, Jacobo J. Salgado, José M. Pereira and Carlos Amiama, University of Santiago de Compostela, Campus Universitario, 27002 Lugo
Metaheuristics for Vehicle Routing Problems
Metaheuristics for Vehicle Routing Problems Metaheuristics Set coordinated by Nicolas Monmarché and Patrick Siarry Volume 3 Metaheuristics for Vehicle Routing Problems Nacima Labadie Christian Prins Caroline
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds.
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. SIMULATION-BASED CONTROL FOR GREEN TRANSPORTATION WITH HIGH DELIVERY SERVICE
Vehicle Routing at a Food Service Marketplace
INDIAN INSTITUTE OF MANAGEMENT AHMEDABAD INDIA Research and Publications Vehicle Routing at a Food Service Marketplace Kavitha Chetana Didugu Chetan Soman W. P. No. 2017-04-03 April 2017 The main objective
epub WU Institutional Repository
epub WU Institutional Repository Vera Hemmelmayr and Karl Doerner and Richard F. Hartl and Daniele Vigo Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid
Rahma Lahyani. Positions. Degrees. Research Interest
Rahma Lahyani PhD, Assistant Professor of OM/MS College of Business Alfaisal University, P.O. Box 50927 Riyadh, 11533, Saudi Arabia Phone : +966112158985 (office) Email: rlahyani@alfaisal.edu; rahma.lahyani@cirrelt.ca
Available online at ScienceDirect. Procedia Manufacturing 11 (2017 ) Wan Chen Chiang, Chen Yang Cheng*
Available online at www.sciencedirect.com ScienceDirect Procedia Manufacturing 11 (2017 ) 2156 2163 27th International Conference on Flexible Automation and Intelligent Manufacturing, FAIM2017, 27-30 June
Towards Collaborative Optimisation in a Shared-Logistics Environment for Pickup and Delivery Operations
Towards Collaborative Optimisation in a Shared-Logistics Environment for Pickup and Delivery Operations Timothy Curtois 1, Wasakorn Laesanklang 1, Dario Landa-Silva 1, Mohammad Mesgarpour 2 and Yi Qu 1
Open Vehicle Routing Problem by Ant Colony Optimization
Open Vehicle Routing Problem by Ant Colony Optimization Er. GurpreetSingh 1 Lecturer,Deptt. of CSE 1 SBBSIET 1 Padhiana, Punjab, India 1 Dr. Vijay Dhir 2 Associate Professor & Head, Deptt. of CSE 2 SBBSIET
PROBABILISTIC DIVERSIFICATION AND INTENSIFICATION IN LOCAL SEARCH FOR VEHICLE ROUTING. Yves Rochat. Éric D. Taillard
CRT 5 13, ORWP 5/03, October 15. To appear in Journal of heuristics 1, 15, pp. 147 167 PROBABILISTIC DIVERSIFICATION AND INTENSIFICATION IN LOCAL SEARCH FOR VEHICLE ROUTING Abstract : Yves Rochat Département
Route Management. White Paper. More than just route optimization.
Route Management More than just route optimization White Paper www.fleetmind.com Table of Contents Introduction from FleetMind...1 What is route management?...2 What are the potential savings/benefits?...3
Vehicle Routing Problems in Supply Chain Management
Lecture 12. Vehicle Routing Problems in Supply Chain Management With the emergence of international markets and the growth of globalization, the management of supply chains has gained increased attention.
On the dynamic technician routing and scheduling problem
On the dynamic technician routing and scheduling problem Victor Pillac, Christelle Gueret, Andrés Medaglia To cite this version: Victor Pillac, Christelle Gueret, Andrés Medaglia. On the dynamic technician
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results X. Wang, B. Golden, and E. Wasil INFORMS Minneapolis October, 2013 Introduction In the Multi-Depot VRP,
A Multiple Ant Colony System for a Vehicle Routing Problem with Time Windows and Uncertain Travel Times
Journal of Traffic and Logistics Engineering Vol. 2, No. 1, March 2014 A Multiple Ant Colony System for a Vehicle Routing Problem with Time Windows and Uncertain Travel Times Nihat Engin Toklu, Luca Maria
Short term strategies for a dynamic multi-period routing problem
Short term strategies for a dynamic multi-period routing problem E. Angelelli a, N. Bianchessi a, R. Mansini b, M.G. Speranza a a Dipartimento Metodi Quantitativi, University of Brescia, Italy b Dipartimento
Multi-Attribute Vehicle Routing Problems (Part I)
Multi-Attribute Vehicle Routing Problems (Part I) Analysis of heuristics and winning strategies Thibaut Vidal Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, USA
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem Rodrigo Lankaites Pinheiro, Dario Landa-Silva and Jason Atkin Abstract The workforce scheduling and routing problem (WSRP)
Minimum cost VRP with time-dependent speed data and congestion charge
Minimum cost VRP with time-dependent speed data and congestion charge Liang Wen *, Richard Eglese Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, UK Abstract
An evolutionary algorithm for a real vehicle routing problem
Int. Journal of Business Science and Applied Management, Volume 7, Issue 3, 2012 An evolutionary algorithm for a real vehicle routing problem Panagiotis Adamidis Alexander TEI of Thessaloniki, Department
A MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT
A MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT City CEDM City Distribution CEDM Distribution Terminal Terminal LOGISTICS BASE Jaume Barceló Hanna Grzybowska
Metaheuristics applied to the feature selection problem
Metaheuristics applied to the feature selection problem Tom Fredrik B. Department of Mathematics University of Oslo Master presentation 28th June - 2006 What we will see Motivation Feature selection I
Synchronization in Vehicle Routing A Survey of VRPs with Multiple Synchronization Constraints
Synchronization in Vehicle Routing A Survey of VRPs with Multiple Synchronization Constraints Technical Report LM-2011-02 Michael Drexl Chair of Logistics Management, Gutenberg School of Management and
Advanced Metaheuristics. Daniele Vigo D.E.I. - Università di Bologna
Advanced Metaheuristics Daniele Vigo D.E.I. - Università di Bologna daniele.vigo@unibo.it Main families of Metaheuristics Single-solution methods Basic: Tabu Search, Simulated Annealing Advanced: Iterated
1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS
1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS Professor Cynthia Barnhart Professor Nigel H.M. Wilson Fall 2003 1.224J/ ESD.204J Outline Sign-up Sheet Introductions Carrier
A Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems
A Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems André Scholz Gerhard Wäscher Otto-von-Guericke University Magdeburg, Germany Faculty of Economics
Álvaro Lozano Murciego a, Gabriel Villarrubia González a, Alberto López Barriuso a, Daniel Hernández de la Iglesia a and Jorge Revuelta Herrero a murciego@acm.org, gvg@acm.org, albarriuso@acm.org, ahernandezdelaiglesia@acm.org,
Scheduling and Rostering of Flexible Labour at Container Port Terminals using Metaheuristic Algorithms
Scheduling and Rostering of Flexible Labour at Container Port Terminals using Metaheuristic Algorithms Ali Rais Shaghaghi 1*, Tom Corkhill 2 and Abdellah Salhi 1 1. Department of Mathematical Sciences,
Synchronization in Vehicle Routing A Survey of VRPs with Multiple Synchronization Constraints
Gutenberg School of Management and Economics Discussion Paper Series Synchronization in Vehicle Routing A Survey of VRPs with Multiple Synchronization Constraints Michael Drexl January 2011 Discussion
ArcGIS Network Analyst: Network Analysis with ArcGIS Online and On- Premises Services
ArcGIS Network Analyst: Network Analysis with ArcGIS Online and On- Premises Services Deelesh Mandloi Dmitry Kudinov Esri UC 2014 Technical Workshop Introductions Who are we? - Network Analyst Product
A DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS
A DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS An Caris Gerrit K. Janssens Transportation Research Institute Hasselt University - campus Diepenbeek Wetenschapspark
A TABU SEARCH METAHEURISTIC FOR ASSIGNMENT OF FLOATING CRANES
1 st Logistics International Conference Belgrade, Serbia 28 - November 13 A TABU SEARCH METAHEURISTIC FOR ASSIGNMENT OF FLOATING CRANES Dragana M. Drenovac * University of Belgrade, Faculty of Transport
International Conference on Education, Management, Commerce and Society (EMCS 2015)
International Conference on Education, Management, Commerce and Society (EMCS 2015) Research to Improve Vehicle Scheduling Efficiency in the Supply Chain on the Strategies: Automotive Logistics & Distribution
A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators
MIC 2009: The VIII Metaheuristics International Conference
: The VIII Metaheuristics International Conference id-1 Investigating Genetic Algorithms for Solving the Multiple Vehicle Pickup and Delivery Problem with Time Windows 1 Introduction Manar Hosny Christine
Prof. Ali S. Huzayyin
بسم االله الرحمن الرحيم Evolution of Cairo Transport & Land Use and of their Effects on Energy & Environment; Problems, Solutions and Potentials Ali S Huzayyin Prof. of Transport & Traffic Engineering