Application oriented variable fixing methods for the multiple depot vehicle scheduling problem

Dávid Balázs and Krész Miklós: Application oriented variable fixing methods for the multiple depot vehicle scheduling problem. In: Acta cybernetica, (21) 1. pp. 53-73. (2013)

[thumbnail of actacyb_21_1_2013_5.pdf]
Preview
Cikk, tanulmány, mű
actacyb_21_1_2013_5.pdf

Download (184kB) | Preview

Abstract

In this article, we present heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches. These methods are constructed in a way that takes some basic driver requirements into consideration as well. We show the efficiency of the methods on real-life and random data instances too. We also give an improved way of generating random input for the vehicle scheduling problem.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2013
Volume: 21
Number: 1
ISSN: 0324-721X
Page Range: pp. 53-73
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38535/
DOI: 10.14232/actacyb.21.1.2013.5
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 72-73. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 17. 10:38
Last Modified: 2022. Jun. 17. 15:14
URI: http://acta.bibl.u-szeged.hu/id/eprint/30849

Actions (login required)

View Item View Item