Athos - A Model Driven Approach to Describe and Solve Optimisation Problems

Hoffmann, Benjamin; Chalmers, Kevin; Urquhart, Neil; Guckert, Michael

doi:10.1145/3300111.3300114

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

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%

“…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%

See 1 more Smart Citation

Simulating Dynamic Vehicle Routing Problems with Athos

Guckert

2019

AKWI

View full text Add to dashboard Cite

Complex routing problems, such as vehicle routing problems with additional constraints, are both hard to solve and hard to express in a form that is accessible to the human expert and at the same time processible by a computer system that is supposed to produce a solution of suf�?cient quality. The formulation must be formal enough to avoid ambiguities and also comprehensible enough to be created, discussed and shared by domain experts. In this paper, we present the domain speci�?c language Athos in which complex routing problems can be expressed in a computationally independent, human-readable form. Athos is then transformed into code that can be run in an adequate target platform. Suitable methods for solving problems are available and applied to the given problem. We present a case study in which we use a genetic algorithm to solve instances of a vehicle routing problem with time windows and demonstrate the end to end process to produce a solution in the Athos environment. Moreover, we show how the Athos system goes beyond optimisation of static routes and can be used as a tool to simulate the impact of traf�?c and congestion on the tours. We call this extended problem a dynamic vehicle routing problem with time windows.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Case Studymentioning

confidence: 99%

Simulating Dynamic Vehicle Routing Problems with Athos

Guckert

2019

AKWI

View full text Add to dashboard Cite

show abstract

Is Usability Evaluation of DSL Still a Trending Topic?

Poltronieri

Pedroso

Zorzo

et al. 2021

Human-Computer Interaction. Theory, Methods and Tools

View full text Add to dashboard Cite

A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation

Zeng

Huang

2019

Sustainability

View full text Add to dashboard Cite

In this paper, a home service problem is studied, where a capacitated vehicle collects customers’ parcels in one pick-up tour. We consider a situation where customers, who have scheduled their services in advance, may call to cancel their appointments, and customers, who do not have appointments, also need to be visited if they request for services as long as the capacity is allowed. To handle those changes that occurred over the tour, a dynamic strategy will be needed to guide the vehicle to visit customers in an efficient way. Aimed at minimizing the vehicle’s total expected travel distance, we model this problem as a multi-dimensional Markov Decision Process (MDP) with finite exponential scale state space. We exactly solve this MDP via dynamic programming, where the computing complexity is exponential. In order to avoid complexity continually increasing, we aim to develop a fast looking-up method for one already-examined state’s record. Although generally this will result in a huge waste of memory, by exploiting critical structural properties of the state space, we obtain an O ( 1 ) looking-up method without any waste of memory. Computational experiments demonstrate the effectiveness of our model and the developed solution method. For larger instances, two well-performed heuristics are proposed.

show abstract

Athos - A Model Driven Approach to Describe and Solve Optimisation Problems

Cited by 3 publications

References 18 publications

Simulating Dynamic Vehicle Routing Problems with Athos

Simulating Dynamic Vehicle Routing Problems with Athos

Is Usability Evaluation of DSL Still a Trending Topic?

A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation

Contact Info

Product

Resources

About