A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case

Faïz, Sami; Krichen, Saoussen; Inoubli, Wissem

doi:10.1016/j.ejrs.2013.10.001

Cited by 13 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Many scholars have conducted research on this and set relevant constraints and studied different types of CVRPs [4]. Aiming at the minimum driving distance of vehicles, Faiza [5] developed a decision support system with an integrated taboo search module to solve the CVRP problem and applied it to a food delivery company on Janduba Island in northwestern Tunisia. It was verified that the central processing unit running time of the decision support system was short.…”

Section: Capacitated Vehicle Routing Problem (Cvrp)mentioning

confidence: 99%

An Empirical Study for Green Transportation Scheme of Municipal Solid Waste Based on Complex Data Model Analysis

Xin

Wang

Liu

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Solid waste management and air pollution are two pressing issues in the functioning of large cities. This paper studies the optimization problem of the green transportation route of municipal solid waste and establishes a mathematical planning model based on real-time traffic conditions of the city and consideration of a time window and multiple transfer stations with the goal of minimizing energy consumption. In the optimal green transportation process in this paper, comprehensive consideration of vehicle speed, vehicle load, road gradient, and driving distance in different road sections based on real-time traffic conditions is incorporated, which has a better fuel-saving potential than the shortest path. A green transportation program can alleviate the air pollution problem in big cities and promote energy conservation and emission reduction in solid waste transportation.

show abstract

Section: Capacitated Vehicle Routing Problem (Cvrp)mentioning

confidence: 99%

An Empirical Study for Green Transportation Scheme of Municipal Solid Waste Based on Complex Data Model Analysis

Xin

Wang

Liu

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The capacitated vehicle routing problem (CVRP) is one of the variants of the VRP. The CVRP consists, in its basic version, of designing a set of minimum cost-routes for several identical vehicles having a fixed capacity to serve a set of customers with known demands [14]. The MTZ constraints are u i − u j + ny ij ≤ n − 1 for all j = 1 and i = j…”

Section: The Miller-tucker-zemlin (Mtz) Formulationmentioning

confidence: 99%

Comparison of the Sub-Tour Elimination Methods for the Asymmetric Traveling Salesman Problem Applying the SECA Method

Bazrafshan

Zolfani

Al-e-hashem

2021

Axioms

View full text Add to dashboard Cite

There are many sub-tour elimination constraint (SEC) formulations for the traveling salesman problem (TSP). Among the different methods found in articles, usually three apply more than others. This study examines the Danzig–Fulkerson–Johnson (DFJ), Miller–Tucker–Zemlin (MTZ), and Gavish–Graves (GG) formulations to select the best asymmetric traveling salesman problem (ATSP) formulation. The study introduces five criteria as the number of constraints, number of variables, type of variables, time of solving, and differences between the optimum and the relaxed value for comparing these constraints. The reason for selecting these criteria is that they have the most significant impact on the mathematical problem-solving complexity. A new and well-known multiple-criteria decision making (MCDM) method, the simultaneous evaluation of the criteria and alternatives (SECA) method was applied to analyze these criteria. To use the SECA method for ranking the alternatives and extracting information about the criteria from constraints needs computational computing. In this research, we use CPLEX 12.8 software to compute the criteria value and LINGO 11 software to solve the SECA method. Finally, we conclude that the Gavish–Graves (GG) formulation is the best. The new web-based software was used for testing the results.

show abstract

“…The 1-PDTSP has several real-world applications, mainely in routing a single commodity through a circular network in a graph connecting different sources and destinations. In this context we address a real case study in the city of Jendouba (Tunisia) studied by Krichen et al [9].…”

Section: Introductionmentioning

confidence: 99%

A DSS Based on Hybrid Meta-Heuristic ILS-VND for Solving the 1-PDTSP

Yahyaoui¹,

Krichen²

2015

Artificial Intelligence and Soft Computing

Self Cite

View full text Add to dashboard Cite

Abstract. The one-commodity pickup-and-delivery travelling salesman problem is a well known combinatorial optimization problem applied in numerous practical situations. It consists of a set of customers dispersed on a geographical area and a vehicle with a predefined capacity that must not be exceeded. The vehicle starts from a depot, and should visit each customer only once then end at at the depot. The objective is to minimize the total length of the traveled path way. As the 1-PDTSP is known to be NP-hard, meta-heuristics perform well when generating solutions in a reasonable computation time. In this paper, we propose a hybrid-meta-heuristic Iterated Local search with Variable Neighborhood Descent (ILS-VND). In order to demonstrate the performance of the proposed approach in term of solution quality, we apply it on benchmark instances. Our approach is also applied in a real case on the city of Jendouba in the north west of Tunisia. The results are then highlighted in a cartographic format using Google Maps.

show abstract

A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case

Cited by 13 publications

References 10 publications

An Empirical Study for Green Transportation Scheme of Municipal Solid Waste Based on Complex Data Model Analysis

An Empirical Study for Green Transportation Scheme of Municipal Solid Waste Based on Complex Data Model Analysis

Comparison of the Sub-Tour Elimination Methods for the Asymmetric Traveling Salesman Problem Applying the SECA Method

A DSS Based on Hybrid Meta-Heuristic ILS-VND for Solving the 1-PDTSP

Contact Info

Product

Resources

About