liu.seSearch for publications in DiVA
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A heuristic approach for scheduling of electrical buses
Linköping University, Department of Mathematics, Optimization . Linköping University, Faculty of Science & Engineering.
2020 (English)Independent thesis Basic level (degree of Bachelor), 14 HE creditsStudent thesis
Abstract [en]

The planning process of public transit systems have for long been a subject treated in operations research. In recent years, research within the public transit area focus on adapting this planning process for electric vehicles. This thesis evaluates a heuristic approach to the vehicle scheduling problem for electrical buses without the use of any licensed software.

Among the previous research is an article that presents a mathematical model for scheduling of electrical buses using AMPL and CPLEX. However, due to not finding optimal solutions for all instances of the problem, the question of a heuristic approach is raised. Literature studies indicate that large neighbourhood search (LNS)-based heuristics have shown previous success for scheduling of vehicles. Results from the implementation of a constructive heuristic combined with an LNS-heuristic are compared with the results from the mathematical model and CPLEX. We see some success using the heuristic approach. However, the method we compare against still provide better solutions for almost all instances. More specifically, the difference between the results (number of buses needed) increases with an increasing complexity of the problem. Finally, due to the lacking results, some recommendations are given for improving the performance of the heuristic.

Place, publisher, year, edition, pages
2020. , p. 48
Keywords [en]
Vehicle scheduling, electrical buses, heuristics
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-165681ISRN: LiTH-MAT-EX--2020/03--SEOAI: oai:DiVA.org:liu-165681DiVA, id: diva2:1429614
Subject / course
Optimization
Supervisors
Examiners
Available from: 2020-05-15 Created: 2020-05-12 Last updated: 2020-05-15Bibliographically approved

Open Access in DiVA

fulltext(1049 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 1049 kBChecksum SHA-512
d50226c7b6cd7a0763ee67468b779552087b12f5cea55bca95f1725ba7ac9407cdca0483295792c68c50ff26c8f5c9cae83ee861635b6fcb7c3332b53f2ae5a2
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lindberg, Rasmus
By organisation
Optimization Faculty of Science & Engineering
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 83 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf