نتایج جستجو برای: pickup and delivery

تعداد نتایج: 16858749  

Journal: :CoRR 2018
Matheus Nohra Haddad Rafael Martinelli Thibaut Vidal Luiz Satoru Ochi Simone L. Martins Marcone J. F. Souza Richard F. Hartl

We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly l...

Journal: :ITOR 2010
Richard Lusby Jesper Larsen Matthias Ehrgott David M. Ryan

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...

Journal: :Transportation Science 2006
Stefan Ropke David Pisinger

The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...

2013
Zhengzheng Xu Jiafu Tang

This paper studies the vehicle routing and scheduling problem with time windows in the pickup and delivery service for customers via vehicles. After discussing the collaborative pattern of vehicles and defining the isolated customer point, we derive the model and strategy of single-pass multiple vehicle collaborations. And then we propose a heuristic algorithm based on single-pass multiple vehi...

H. Larki M. Sayyah M. Yousefikhoshbakht,

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

2005
Stefan Ropke

The pickup and delivery problem with time windows is the problem of serving a number of transportationrequests using a limited amount of vehicles. Each request involves moving a number of goods from apickup location to a delivery location. Our task is to construct routes that visit all locations such thatcorresponding pickups and deliveries are placed on the same route and such that...

Journal: :International Journal on Artificial Intelligence Tools 2002

Journal: :INFOR: Information Systems and Operational Research 2016

Journal: :Computers & Mathematics with Applications 1997

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید