The locomotive fleet fueling problem

Tal Raviv; Mor Kaspi

doi:https://doi.org/10.1016/j.orl.2011.11.001

The locomotive fleet fueling problem

Tal Raviv, Mor Kaspi

Department of Industrial Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

This paper considers the problem of how to determine an optimal fueling schedule and contracting policy with fuel suppliers so as to minimize the total cost of the fueling operation. The problem is formulated as a mixed integer program and the formulation is enhanced by valid inequalities and domination rules. The enhanced model allows us to obtain near optimal solutions for large scale instances.

Original language	English
Pages (from-to)	39-45
Number of pages	7
Journal	Operations Research Letters
Volume	40
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2011.11.001
State	Published - Jan 2012

Keywords

Mixed integer programming
Railway application
Valid inequalities

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

https://doi.org/10.1016/j.orl.2011.11.001

Cite this

@article{5bfd149aaabc49308866cf45f8a833a6,

title = "The locomotive fleet fueling problem",

abstract = "This paper considers the problem of how to determine an optimal fueling schedule and contracting policy with fuel suppliers so as to minimize the total cost of the fueling operation. The problem is formulated as a mixed integer program and the formulation is enhanced by valid inequalities and domination rules. The enhanced model allows us to obtain near optimal solutions for large scale instances.",

keywords = "Mixed integer programming, Railway application, Valid inequalities",

author = "Tal Raviv and Mor Kaspi",

year = "2012",

month = jan,

doi = "https://doi.org/10.1016/j.orl.2011.11.001",

language = "الإنجليزيّة",

volume = "40",

pages = "39--45",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The locomotive fleet fueling problem

AU - Raviv, Tal

AU - Kaspi, Mor

PY - 2012/1

Y1 - 2012/1

N2 - This paper considers the problem of how to determine an optimal fueling schedule and contracting policy with fuel suppliers so as to minimize the total cost of the fueling operation. The problem is formulated as a mixed integer program and the formulation is enhanced by valid inequalities and domination rules. The enhanced model allows us to obtain near optimal solutions for large scale instances.

AB - This paper considers the problem of how to determine an optimal fueling schedule and contracting policy with fuel suppliers so as to minimize the total cost of the fueling operation. The problem is formulated as a mixed integer program and the formulation is enhanced by valid inequalities and domination rules. The enhanced model allows us to obtain near optimal solutions for large scale instances.

KW - Mixed integer programming

KW - Railway application

KW - Valid inequalities

UR - http://www.scopus.com/inward/record.url?scp=84855884250&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.orl.2011.11.001

DO - https://doi.org/10.1016/j.orl.2011.11.001

M3 - مقالة

SN - 0167-6377

VL - 40

SP - 39

EP - 45

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -

The locomotive fleet fueling problem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this