A Multi-Agent System based on the Multi-Objective Simulated Annealing Algorithm for the Static Dial a Ride Problem

Zidi, Issam; Zidi, Kamel; Mesghouni, Khaled; Ghédira, Khaled

doi:10.3182/20110828-6-it-1002.02639

Cited by 13 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One change moved we used as neighborhood structure; Reorder route, based on the method found in the work [18]. The Re-order route move consists basically in choosing a route of the solution, select any point in this route, select a new position for this point and then change the position of this point with the new position, This movement is shown in Fig.…”

Section: ) Neighborhood Structurementioning

confidence: 99%

A hybrid approach based on Multi-Objective Simulated Annealing and Tabu Search to solve the Dynamic dial a Ride Problem

Khelifi¹,

Zidi²,

Zidi³

et al. 2013

2013 International Conference on Advanced Logistics and Transport

Self Cite

View full text Add to dashboard Cite

This paper describes an application of a Hybrid Algorithm based on the Multi-Objective Simulated AnnealingTabu Search (MOSA-TS) to solve the dynamic Dial a Ride Problem (DRP). In fact, different versions of the dynamic Dial k Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and to solve the dynamic DRP in the application using a multi agent system based on Hybrid Algorithm: Multi-Objective Simulated Annealing -Tabu Search (MOSA-TS).

show abstract

Section: ) Neighborhood Structurementioning

confidence: 99%

A hybrid approach based on Multi-Objective Simulated Annealing and Tabu Search to solve the Dynamic dial a Ride Problem

Khelifi¹,

Zidi²,

Zidi³

et al. 2013

2013 International Conference on Advanced Logistics and Transport

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [11], a multi-agent system based on a multi-objective simulated annealing is used to solve the SDRP (Static Dial a Ride Problem). The aim is to give a certain quality of service provided and reduce the route duration.…”

Section: Related Workmentioning

confidence: 99%

An Application of Adapted A* Decentralized Approach for On Demand Transportation Problem

Falou

Malass

Itmi

et al. 2014

2014 IEEE 26th International Conference on Tools With Artificial Intelligence

View full text Add to dashboard Cite

In recent years, the "on demand transport-ODT" systems are increasingly popular in many cities around the world. An ODT system is defined by three components: the infrastructure of the city, the vehicles and the clients requests. Clients formulate requests for transportation between a pickup and a drop off places. These requests must be served on time by satisfying a set of constraints. We propose a new approach to resolve ODT problem as a multi-agent distributed planning problem. Our model reduces the exponential complexity of the problem, when solved by a decentralized approach based on A* algorithm, to be polynomial. The experimental results confirm the effectiveness of our approach to have a real-time scale up system. Our mutli-agent model is a strong first step to have a realistic ODT system taking into account environment and transport infrastructure conditions.

show abstract

“…A different metaheuristic used for solving DARPTW is Simulated Annealing (SA); for example, in [6] this technique was mixed with other specialized smaller heuristics, generating an efficient and stable approach that particularly improved quality of service issues. In [7], a multiobjective SA algorithm was implemented and embedded into a multiagent system to solve the dynamic version of the problem.…”

Section: Mathematical Problems In Engineeringmentioning

confidence: 99%

“…(v) 5 : weight on time-window violation, that is, penalty applied when a vehicle arrives too early or too late at a location, (vi) 6 : weight on excess of maximum ride time, that is, penalty applied when MRT is violated, (vii) 7 : weight on excess of route duration, that is, penalty applied when MRD is violated.…”

Section: Dial-a-ride Problem With Time Windowsmentioning

confidence: 99%

A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

Urra

Cubillos

Cabrera‐Paniagua

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The dial-a-ride problem with time windows (DARPTW) is a combinatorial optimization problem related to transportation, in which a set of customers must be picked up from an origin location and they have to be delivered to a destination location. A transportation schedule must be constructed for a set of available vehicles, and several constraints have to be considered, particularly time windows, which define an upper and lower time bound for each customer request in which a vehicle must arrive to perform the service. Because of the complexity of DARPTW, a number of algorithms have been proposed for solving the problem, mainly based on metaheuristics such as Genetic Algorithms and Simulated Annealing. In this work, a different approach for solving DARPTW is proposed, designed, and evaluated: hyperheuristics, which are alternative heuristic methods that operate at a higher abstraction level than metaheuristics, because rather than searching in the problem space directly, they search in a space of low-level heuristics to find the best strategy through which good solutions can be found. Although the proposed hyperheuristic uses simple and easy-to-implement operators, the experimental results demonstrate efficient and competitive performance on DARPTW when compared to other metaheuristics from the literature.

show abstract

A Multi-Agent System based on the Multi-Objective Simulated Annealing Algorithm for the Static Dial a Ride Problem

Cited by 13 publications

References 6 publications

A hybrid approach based on Multi-Objective Simulated Annealing and Tabu Search to solve the Dynamic dial a Ride Problem

A hybrid approach based on Multi-Objective Simulated Annealing and Tabu Search to solve the Dynamic dial a Ride Problem

An Application of Adapted A* Decentralized Approach for On Demand Transportation Problem

A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

Contact Info

Product

Resources

About