A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Souza, Marcone Jamilson Freitas; Mine, Marcio Tadayuki; Silva, Matheus de Souza Alves; Ochi, Luiz Satoru; Subramanian, Anand

doi:10.1504/ijlsm.2011.042625

Cited by 19 publications

(11 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since VRPSPD is an NP-hard combinatorial optimization problem, very few studies have used exact approaches, and most recent studies have focused on metaheuristic algorithms [6]. Metaheuristic approaches used in recent years to solve the VRPSPD include the genetic algorithm (GA) [8], tabu search (TS) [9], greedy particle swarm optimization [10], ant colony optimization (ACO) [11], iterated local search algorithm [12], and simulated annealing (SA) [13]. The most recent studies related to the VRPSPD are summarized in the study by Montoya-Torres et al [14].…”

Section: Literature Reviewmentioning

confidence: 99%

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

et al. 2019

View full text Add to dashboard Cite

Although demand responsive feeder bus operation is possible with human-driven vehicles, it has not been very popular and is mostly available as a special service because of its high operating costs due to intensive labor costs as well as requirement for advanced real-time information technology and complicated operation. However, once automated vehicles become available, small-sized flexible door-to-door feeder bus operation will become more realistic, so preparing for such automated flexible feeder services is necessary to take advantage of the rapid improvement of automated vehicle technology. Therefore, in this research, an algorithm for optimal flexible feeder bus routing, which considers relocation of buses for multiple stations and trains, was developed using a simulated annealing algorithm for future automated vehicle operation. An example was developed and tested to demonstrate the developed algorithm. The algorithm successfully handled relocation of buses when the optimal bus routings were not feasible using the buses available at certain stations. Furthermore, the developed algorithm limited the maximum degree of circuity for each passenger while minimizing the total cost, including total vehicle operating costs and total passenger in-vehicle travel time costs.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Thus, there is no need to explicitely indicate both variables and as in VRPPD. It is found in the literature that the heuristics of [27], Zachariadis and Kiranoudis (2011) [28] and Souza et al (2010) [29] together produce the best known results.…”

Section: Vrp With Simultaneous Pickup and Delivery (Vrpspd)mentioning

confidence: 99%

Analysis of Mathematical Formulations of Capacitated Vehicle Routing Problem and Methods for their Solution

Beresneva¹,

Avdoshin²

2018

Proceedings of ISP RAS

View full text Add to dashboard Cite

Abstract. Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. In this study we analyze Capacitated Vehicle Routing Problem (CVRP) -a subcase of VRP, where the vehicles have a limited capacity. CVRP is mostly aimed at savings in the global transportation costs. The problem is NP-hard, therefore heuristic algorithms which provide near-optimal polynomial-time solutions will be considered instead of the exact ones. The aim of this article is to make a survey on mathematical formulations of CVRP and on methods for solving each type of this problem. The first part presents a general information about the problem and restrictions of this work. In the second part, the classical mathematical formulations of CVRP are described. In the third part, a classification of most popular subcases of CVRP is given, including description of additional constraints with their math formulations. This section also includes most perspective methods that can be applied for solving special types of CVRP. The forth part contains an important note about the most powerful algorithm LKH-3. Finally, the fourth part consists of table with solving techniques for each subproblem and of scheme with basic problems of the CVRP class and their interconnections.

show abstract

“…A 2-opt move is an intra-route neighborhood structure that consists in removing two non-adjacent arcs and inserting two new arcs, so that a new route is formed. Figure 2 exemplifies the movement: edges (4, 6) and (5,8) of Route 2 are removed and edges (4,8) and (6,5) are inserted instead. Note that an inversion took place involving customers 6, 16 and 8.…”

Section: Neighborhood Structuresmentioning

confidence: 99%

“…Heuristic methods like the one presented in this paper are the most common approach to solve this type of problems. In particular, we use a heuristic algorithm, the GILS-VND, that combines three different procedures: 1) an Iterated Local Search (ILS) [4,5,6], 2) a Greedy Randomized Adaptive Search Procedure (GRASP) [7,8], and 3) a Variable Neighborhood Descent (VND) [9]. We test our algorithm using real instances provided by the company.…”

Section: Introductionmentioning

confidence: 99%

An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints

Coelho

Grasas

Ramalhinho

et al. 2016

European Journal of Operational Research

View full text Add to dashboard Cite

Distribution planning is crucial for most companies since goods are rarely produced and consumed at the same place. Distribution costs, in addition, can be an important component of the final cost of the goods. In this paper, we study a VRP variant inspired on a real case of a large distribution company. In particular, we consider a VRP with a heterogeneous fleet of vehicles that are allowed to perform multiple trips. The problem also includes docking constraints in which some vehicles are unable to serve some particular customers. Given the combinatorial nature and the size of the problem, which discard the use of efficient exact methods for its resolution, a novel heuristic algorithm is proposed. The proposed algorithm, called GILS-VND, combines Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) procedures. Our method obtains better solutions than other approaches found in the related literature, and improves the solutions used by the company leading to * Corresponding author * * Principal corresponding author

show abstract

A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Cited by 19 publications

References 23 publications

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

Analysis of Mathematical Formulations of Capacitated Vehicle Routing Problem and Methods for their Solution

An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints

Contact Info

Product

Resources

About