A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications

Jatschka, Thomas; Rodemann, Tobias; Raidl, Günther R.

doi:10.1007/978-3-030-94216-8_1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It traverses the search space by iteratively destroying and repairing parts of the so-far best-found solution. LNS has been successfully applied to different problems such as vehicle routing [24], job scheduling [25], and placement of service points [26]. The proposed LNS employs a MILP-based repair operator.…”

Section: Introductionmentioning

confidence: 99%

Large Neighborhood Search for Electric Vehicle Fleet Scheduling

2023

View full text Add to dashboard Cite

This work considers the problem of planning how a fleet of shared electric vehicles is charged and used for serving a set of reservations. While exact approaches can be used to efficiently solve small to medium-sized instances of this problem, heuristic approaches have been demonstrated to be superior in larger instances. The present work proposes a large neighborhood search approach for solving this problem, which employs a mixed integer linear programming-based repair operator. Three variants of the approach using different destroy operators are evaluated on large instances of the problem. The experimental results show that the proposed approach significantly outperforms earlier state-of-the-art methods on this benchmark set by obtaining solutions with up to 8.5% better objective values.

show abstract

Section: Introductionmentioning

confidence: 99%