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
Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows
C. Hauman,James Bekker +1 more
TL;DR: Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows is applied and shows promise in solving the soft time window routing problem.
Journal ArticleDOI
Integrating Livability Principles into transit planning: Screening Chicago bus rapid transit opportunities
Joshua K. Anderson,Josh Ellis +1 more
TL;DR: In this article, the authors identified 10 potential BRT routes for further consideration and evaluated the Livability Principles guiding investment by the U.S. government, and the remaining contiguous street sections were scored on the weighted performance of 14 quantitative proxies for the livability principles.
Journal ArticleDOI
Cloud Based Evolution Algorithm with Feedback Control for Emergency Logistic
TL;DR: A parallel and distributed evolutionary algorithm based on the cloud computing environment and feedback control algorithm to help planners solve the emergency logistic problems and take less effort on deploying both computation power and storage space is developed.
Proceedings ArticleDOI
A hybrid multi-objective iterated local search heuristic for vehicle routing problem with time windows
TL;DR: A hybrid heuristic based on Iterated Local Search, Variable Neighbourhood Descent with random neighbourhood ordering for solution improvement and Recombination of non-dominated solutions as used in genetic algorithms is proposed to obtain near Pareto-optimal solutions.
Problema de rotas : um estudo via métodos exatos e heurísticos em uma empresa de estofados
Abstract: Operational research offers managers the opportunity to make more efficient decisions, as it relies on deterministic and non-deterministic methods such as linear programming, nonlinear programming, whole programming and/or mixed, through bases Scientific and mathematical models. In recent years there has been a great demand for solving optimization problems related to operational research, and one of them is the shortest path problem, that is, to determine the shortest route to be traveled on a given path. Given this context, the present study aims to apply the problem of routes in a upholstery company located in the northern region of Paraná, in order to define the route that minimizes the distances to be traveled by the trucks that carry out the deliveries of the products in different regions of Brazil. For this, exact methods were used, which find the best solution for a given problem and heuristic methods, which find good solutions, but not necessarily great. The exact methods were tested through the LibreOffice Cal Solver as well as the Cplex software, and the heuristic methods were tested through the Julia programming language. The results obtained for the two different methods used were compared with the results presented by the company and proved satisfactory, proving the efficiency and efficacy of the use of operational research techniques mainly in Real problems.
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.