Journal ArticleDOI
Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
TLDR
In this article, the authors formulated the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem and developed a hybrid heuristic algorithm to solve this problem.Abstract:
The vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) has attracted much research interest because of the potential to provide cost savings to transportation and logistics operators. Several extensions of VRPSDP exist. Of these extensions, the simultaneous deliveries and pickups with split loads problem (SDPSLP) has been proposed to eliminate vehicle capacity constraints, as well as allow the deliveries or pickups for a customer to be split into multiple visits. Although delivery and pickup activities are often constrained by time windows, few studies have considered such constraints when SDPSLP has been addressed. To fill the gap, this paper formulates the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem. A hybrid heuristic algorithm was developed to solve this problem. Solomon data sets with minor modifications were applied to test the effectiveness of the solution algorithm. The r...read more
Citations
More filters
Journal ArticleDOI
UAV Swarm Scheduling Method for Remote Sensing Observations during Emergency Scenarios
TL;DR: The task allocation model was constructed, and the model was solved via a particle swarm optimization algorithm to obtain the UAV swarm scheduling scheme, which has high usability and efficiency.
Journal ArticleDOI
A reinforcement learning-Variable neighborhood search method for the capacitated Vehicle Routing Problem
TL;DR: In this article , a new hyper-heuristic scheme, termed Bandit VNS, inspired by the Multi-Armed Bandit (MAB), was proposed to find the best sequence of local search operators that yields the optimal performance of Variable Neighborhood Search (VNS).
Journal ArticleDOI
Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option
TL;DR: This work proposes a new type of demand-responsive service as an alternative to inefficient “door-to-door” service based on service units designed to aggregate passengers for shuttle service and proves that the proposed service is more suitable for the request distributions that are spatiotemporally concentrated.
Dissertation
Problèmes de tournées de véhicules et application industrielle pour la réduction de l'empreinte écologique
TL;DR: Les metaheuristiques developpees font appel a un ensemble of techniques particulierement efficaces telles that le decoupage optimal, les operateurs de croisement genetiques ainsi that des methodes de recherches locales.
Journal ArticleDOI
An evolutionary algorithm for solving Capacitated Vehicle Routing Problems by using local information
TL;DR: In this paper , a fast evolutionary algorithm is proposed to solve the Capacitated Vehicle Routing Problem (CVRP), which aims to determine the routes for a fleet of vehicles to serve a group of customers with minimum travel cost.
References
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
Journal ArticleDOI
Savings by Split Delivery Routing
Moshe Dror,Pierre Trudeau +1 more
TL;DR: This paper examines a relaxed version of the generic vehicle routing problem, in which a delivery to a demand point can be split between any number of vehicles, and demonstrates the potential for cost savings through split deliveries.
Journal ArticleDOI
Solving the pickup and delivery problem with time windows using reactive tabu search
William P Nanry,J. Wesley Barnes +1 more
TL;DR: In this article, a reactive tabu search approach is proposed to solve the pickup and delivery problem with time windows using three distinct move neighborhoods that capitalize on the dominance of the precedence and coupling constraints.