scispace - formally typeset
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

Unified Route Planning for Shared Mobility: An Insertion-based Framework

TL;DR: This paper presents a unified formulation of route planning called URPSM, which has a well-defined parameterized objective function which eliminates the contradicted objectives in previous studies and enables flexible multi-objective route planning for shared mobility.
Journal ArticleDOI

Making Cities Smarter—Optimization Problems for the IoT Enabled Smart City Development: A Mapping of Applications, Objectives, Constraints

TL;DR: This review presents a coverage of optimization methods and applications from a smart city perspective enabled by the Internet of Things (IoT) for five popular optimization methods, ant colony optimization, genetic algorithm, particle swarm optimization, artificial bee colony optimization and differential evolution.
Proceedings ArticleDOI

A Well-Arranged Simulated Annealing Approach for the Location-Routing Problem with Time Windows

TL;DR: A well-arranged simulated annealing approach for a single-stage LRP with time windows is presented and its performance is compared with a sequential and a tabu search heuristic.
Journal ArticleDOI

Hybrid Iterative Local Search Heuristic with a Multiple Criteria Approach for the Vehicle Routing Problem

TL;DR: In this paper, a Hybrid Iterative Local Search Heuristic (HILS) is proposed to escape from local optima when a construction heuristic, for the VRP, has been trapped.
Journal ArticleDOI

A Grid-Based Genetic Approach to Solving the Vehicle Routing Problem with Time Windows

TL;DR: Experimental results show one information exchange reduction through the MiniGrid clusters as well as an improved behavior of the evolutionary algorithm, and a statistical analysis suggests that the approach is better as a combinatorial optimization procedure as compared with other methods.
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

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

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.
Related Papers (5)