230.548 People
Pisinger, David
University of Copenhagen
in Cooperation with on an Cooperation-Score of 37%
Topics
- vehicle occupant
- data
- case study
- passenger
- flight
- airport
- submarine
- customer
- uncertainty
- decision support system
- baggage
- customer satisfaction
- optimization
- price
- bottleneck
- constraint
- airline
- pricing
- timetable
- dynamic programming
- linear programming
- buffer
- baggage handling
- infrastructure
- benchmark
- assessment
- fuel
- routing
- port
- scheduling
- neighborhood
- shopping facility
- port operation
- maritime industry
- sail
- feeder vessel
- water traffic
- logistics
- hub
- intelligence
- artificial intelligence
- instability
- container
- containership
- operations research
- liner shipping
- planning
- drone
- commodity
- delivery traffic
- fuel consumption
- sensitivity
- truck
- impurity
- mathematical model
- parametric analysis
- sensitivity analysis
- productivity
- traveling salesman problem
- truck route
- ship
- weather
- shipment
- fog
- crane
- port congestion
- decomposition
- ridesharing
- costs
- intermodal transportation
- iterative method
- commodity flow
- freight transportation
- investment
- railroad network
- passenger train
- freight train
- managerial personnel
- contaminant
- supplier
- weather condition
- supervisor
- level of service
- customer service
- international trade
- vehicle
- time window
- travel time
- round trip
- railroad track
- freight traffic
- civil engineering
- origin and destination
- head
- boating
- heuristic method
- tramp shipping
- vehicle fleet
- revenue
- train consist
- container traffic
- profitability
- perturbation
- integer programming
- economics
- sulfur
- corporation
- mixed integer programming
- production
- bus
- laceration
- male
- simulated annealing
- annealing
- service time
- vacation
- business trip
- driver
- globalization
- pressure
- engineer
- locomotive engineer
- spinal column
- green logistics
- cost effectiveness
- quality of service
- transportation mode
- employee
- waiting time
- travel
- dispatching
- back haul
- show 102 more
Publications
- 2021Baggage Carousel Assignment at Airports: Model and Case Studycitations
- 2021The Baggage Belt Assignment Problemcitations
- 2020Advanced algorithms for improved baggage handling
- 2020An Adaptive Large Neighbourhood Search Heuristic for Routing and Scheduling Feeder Vessels in Multi-terminal Portscitations
- 2020Constraint Programming and Local Search Heuristic: A Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-Terminal Portscitations
- 2019An adaptive large neighborhood search metaheuristic for the vehicle routing problem with dronescitations
- 2019Liner shipping disruption management in practice: Generating recovery plans for vessels and cargo
- 2019An integrated vessel schedule and aggregated cargo route recovery model
- 2018Decomposition algorithms for the multi-modal ridesharing routing problem
- 2018A flow-first route-next heuristic for liner shipping network designcitations
- 2018Railway capacity and expansion analysis using time discretized pathscitations
- 2016The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shipping
- 2016The Edge Set Cost of the Vehicle Routing Problem with Time Windowscitations
- 2016Speed optimization with route improvements
- 2015Capacity Analysis of Freight Transport with Application to the Danish and Southern Swedish Railwaycitations
- 2015Speed Optimization in Liner Shipping Network Design
- 2014A matheuristic for the liner shipping network design problemcitations
- 2014Bunker Purchasing in Liner Shippingcitations
- 2014Bunker purchasing with contractscitations
- 2013Synchronized dial-a-ride transportation of disabled passengers at airportscitations
- 2013The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shippingcitations
- 2012Solving Vehicle Routing with Full Container Load and Time Windowscitations
- 2011Solving a Vehicle Routing Problem with a non-linear load dependant cost function
- 2011The vehicle routing problem with edge set costs
- 2011Routing and scheduling problems
- 2011A path based model for a green liner shipping network design problem
- 2010Route planning for airport personnel transporting passengers with reduced mobility
- 2010Dynamic Routing of Short Transfer Baggage
- 2008Chvátal-Gomory Rank-1 Cuts used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windowscitations
- 2007A general heuristic for vehicle routing problemscitations
- 2006A non-robust Branch-and-Cut-and-Price algorithm for the Vehicle Routing Problem with Time Windows
- 2006A unified heuristic for a large class of Vehicle Routing Problems with Backhaulscitations
- 2006A Unified Heuristic for Vehicle Routing Problems with Backhaulscitations
Places of action
article
An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
Abstract
Unmanned Aerial Vehicles, commonly known as drones, have attained considerable interest in recent years due to the potential of revolutionizing transport and logistics. Amazon were among the first to introduce the idea of using drones to deliver goods, followed by several other distribution companies working on similar services. The Traveling Salesman Problem, frequently used for planning last-mile delivery operations, can easily be modified to incorporate drones, resulting in a routing problem involving both the truck and aircraft. Introduced by Murray and Chu (2015), the Flying Sidekick Traveling Salesman Problem considers a drone and truck collaborating. The drone can be launched and recovered at certain visits on the truck route, making it possible for both vehicles to deliver goods to customers in parallel. This generalization considerably decreases the operational cost of the routes, by reducing the total fuel consumption for the truck, as customers on the routes can be serviced by drones without covering additional miles for the trucks, and hence increase productivity. In this paper a mathematical model is formulated, defining a problem similar to the Flying Sidekick Traveling Salesman Problem, but for the capacitated multiple-truck case with time limit constraints and minimizing cost as objective function. The corresponding problem is denoted the Vehicle Routing Problem with Drones. Due to the difficulty of solving large instances to optimality, an Adaptive Large Neighborhood Search metaheuristic is proposed. Finally, extensive computational experiments are carried out. The tests investigate, among other things, how beneficial the inclusion of the drone-delivery option is compared to delivering all items using exclusively trucks. Moreover, a detailed sensitivity analysis is performed on several drone-parameters of interest.
Topics
Search in FID move catalog