ECMS 2018 Proceedings Edited by Lars Nolle, Alexandra Burger, Christoph Tholen, Jens Werner, Jens Wellhausen 2018
DOI: 10.7148/2018-0262
|View full text |Cite
|
Sign up to set email alerts
|

A Domain-Specific Language For Routing Problems

Abstract: Vehicle Routing Problems (VRPs) are commonly used as benchmark optimisation problems and they also have many applications in industry. Using agent-based approaches to solve VRPs allows the analysis of dynamic VRP instances that incorporate congestion effects. By using a domain-specific language as part of a model-driven approach, routing problems can be modelled in an abstract form that does not contain implementation and other technical details. With such a tool domain experts can concentrate on the actual mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…We have demonstrated how Athos can be used to model dynamic vehicle routing problems and how solutions can be computed. Besides the evolutionary algorithm presented here Athos provides other heuristics for solving a variety of complex routing problems (see Hoffmann, Guckert, et al 2018 andHoffmann, Chalmers, et al 2019).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…We have demonstrated how Athos can be used to model dynamic vehicle routing problems and how solutions can be computed. Besides the evolutionary algorithm presented here Athos provides other heuristics for solving a variety of complex routing problems (see Hoffmann, Guckert, et al 2018 andHoffmann, Chalmers, et al 2019).…”
Section: Discussionmentioning
confidence: 99%
“…The depot uses a genetic algorithm (Hoffmann, Chalmers, et al 2019) that internally builds a complete graph of all customer nodes (Hoffmann, Guckert, et al 2018) and optimises the function given in (1). Here, K denotes the set of vehicles at the depot, N the set of nodes of the complete graph (including the depot), t ij the travel time from node i to node j and x k ij a decision variable that is set to 1 if vehicle k travels from node i to node j and 0 otherwise.…”
Section: Case Studymentioning
confidence: 99%
“…We have demonstrated how Athos can be used to model dynamic vehicle routing problems and how solutions can be computed. Besides the evolutionary algorithm presented here Athos provides other heuristics for solving a variety of complex routing problems (see Hoffmann, Guckert, et al 2018 andHoffmann, Chalmers, et al 2019). At the moment we extend the Athos environment with a flexible interface to Open Street Map 2 so that the definition of the underlying network can be generated from OSM data rather than be coded manually.…”
Section: Discussionmentioning
confidence: 99%
“…Athos deliberately does not support imperative programming as we aim to provide a purely declarative modelling language. Currently available meta-heuristics libraries in Athos are an implementation of an ACS (Ant Colony System) for solving TSP-like problems Hoffmann, Guckert, et al 2018 and an Evolutionary Algorithm for solving more complex vehicle routing problems like the problem presented in this paper.. The VRPTW describes the task of visiting a set of customers for delivery or pick-up of products, depending on context.…”
Section: Athosmentioning
confidence: 99%
“…While in complete graphs these matrices just store the respective values of the edge connecting two customers or a customer and a depot, in non-complete graph the shortest distance as well as the shortest time between those nodes first has to be computed using Dijkstra's algorithm (cf. [8]).…”
Section: Athos Graphextension Packagementioning
confidence: 99%