Agents Toward Vehicle Routing Problem With Time Windows

Kalina, Petr; Vokřínek, Jiří; Mařı́k, Vladimı́r

doi:10.1080/15472450.2014.889953

Cited by 12 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A popular heuristic method for large-scale dynamic DARP is the Insertion Heuristic (IH) (Bischoff et al, 2017;Campbell & Savelsbergh, 2004;Fiedler et al, 2018;Kalina et al, 2015). Also, IH is often used as a subcomponent of more sophisticated algorithms.…”

Section: Related Workmentioning

confidence: 99%

Large-scale online ridesharing: the effect of assignment optimality on system performance

Fiedler

Čertický

Alonso–Mora

et al. 2022

Journal of Intelligent Transportation Systems

View full text Add to dashboard Cite

Mobility-on-demand (MoD) systems consist of a fleet of shared vehicles that can be hailed for one-way point-to-point trips. The total distance driven by the vehicles and the fleet size can be reduced by employing ridesharing, i.e., by assigning multiple passengers to one vehicle. However, finding the optimal passenger-vehicle assignment in an MoD system is a hard combinatorial problem. In this work, we demonstrate how the VGA method, a recently proposed systematic method for ridesharing, can be used to compute the optimal passenger-vehicle assignments and corresponding vehicle routes in a massive-scale MoD system. In contrast to existing works, we solve all passenger-vehicle assignment problems to optimality, regularly dealing with instances containing thousands of vehicles and passengers. Moreover, to examine the impact of using optimal ridesharing assignments, we compare the performance of an MoD system that uses optimal assignments against an MoD system that uses assignments computed using insertion heuristic and against an MoD system that uses no ridesharing. We found that the system that uses optimal ridesharing assignments subject to the maximum travel delay of 4 minutes reduces the vehicle distance driven by 57% compared to an MoD system without ridesharing. Furthermore, we found that the optimal assignments result in a 20% reduction in vehicle distance driven and 5% lower average passenger travel delay compared to a system that uses insertion heuristic.

show abstract

Section: Related Workmentioning

confidence: 99%

Large-scale online ridesharing: the effect of assignment optimality on system performance

Fiedler

Čertický

Alonso–Mora

et al. 2022

Journal of Intelligent Transportation Systems

View full text Add to dashboard Cite

show abstract

“…are not applicable in this scenario. As an alternative to these approaches, several distributed planning approaches are developed with agent technology (Kalina et al, 2015) and most of the agent approaches are based on the Contract-Net protocol (Liang and Kang, 2016). Using the Contract-Net protocol, an announcement concerning a task to perform is sent within the multi-agent system.…”

Section: Food Products Supply Chain Ecosystemmentioning

confidence: 99%

Semantic transportation planning for food products supply chain ecosystem within difficult geographic zones

Memon

Karray

Letouzey

et al. 2017

IMDS

View full text Add to dashboard Cite

If you would like to write for this, or any other Emerald publication, then please use our Emerald for Authors service information about how to choose which publication to write for and submission guidelines are available for all. Please visit www.emeraldinsight.com/authors for more information. About Emerald www.emeraldinsight.comEmerald is a global publisher linking research and practice to the benefit of society. The company manages a portfolio of more than 290 journals and over 2,350 books and book series volumes, as well as providing an extensive range of online products and additional customer resources and services.Emerald is both COUNTER 4 and TRANSFER compliant. The organization is a partner of the Committee on Publication Ethics (COPE) and also works with Portico and the LOCKSS initiative for digital archive preservation.*Related content and download information correct at time of download. Abstract Purpose -In difficult geographical zones (mountain, intra-cities areas, etc.), many shippers, from small and medium enterprises to individuals, may demand delivery of different food products ( fresh, refrigerated, frozen, etc.) in small quantities. On the other side, carrier companies wish to use their vehicles optimally. Taking into account the perishability constraints (short-shelflife, temperature limits, etc.) of the transported food products and environmental constraints (pollution, carbon impact) while consolidating multiple kinds of food products to use vehicles optimally is not achieved by current transportation planning solutions. The purpose of this paper is to present an interoperable solution of a marketplace, formed by shippers and carriers, dedicated to the schedule of food transport orders. Design/methodology/approach -This transportation planning system named Interoperable-Pathfinder, Order, Vehicle, Environment and Supervisor (I-POVES) is an interoperable multi-agent system, based on the SCEP (supervisor, customer, environment and producer) model (Archimede and Coudert, 2001). Ontologies are developed to create the planning marketplace comprising demands and offers from different sources (multiple shippers and carriers). Findings -A hierarchy ontology for food products. A transporter system ontology. A global ontology that contains all shared concepts used by local ontologies of both shippers and carriers. I-POVES an interoperable model, which facilitates collaboration between carriers and their shippers through its active agents. Practical implications -I-POVES is tested on a case study from the TECCAS Poctefa project, comprising transport and food companies from both sides of the Pyrenees (France and Spain). Originality/value -There has been much work in the literature on the delivery of products, but very few on the delivery of food products. Work related to delivery of food products focuses mostly on timely delivery for avoiding its wastage. In this paper, constraints related to food products and to environment (pollution and carbon impact) of transport resources are taken into account ...

show abstract

“…Several methods for the MTSP have been proposed in literature which is also the case for a very closed problem formulation known as the Vehicle Routing Problem (VRP) where capacity of each vehicle is considered [ 19 ]. Beside auction-based techniques [ 33 ] and multiagent solutions [ 34 ], soft-computing techniques such as genetic algorithms have been proposed for these problems [ 35 ]. Note that the MTSP can be transformed into the TSP using transformation proposed in [ 36 ]; however, such a solution can be highly degenerated for the MTSP with minmax objective.…”

Section: Related Workmentioning

confidence: 99%

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

Faigl

2016

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.

show abstract

Agents Toward Vehicle Routing Problem With Time Windows

Cited by 12 publications

References 28 publications

Large-scale online ridesharing: the effect of assignment optimality on system performance

Large-scale online ridesharing: the effect of assignment optimality on system performance

Semantic transportation planning for food products supply chain ecosystem within difficult geographic zones

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

Contact Info

Product

Resources

About