Heuristic methods for the periodic Shipper Lane Selection Problem in transportation auctions

Chefi Triki, Seyedmehdi Mirmohammadsadeghi, Sujan Piya

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In the Shipper Lane Selection Problem (SLSP) a set of lanes should be classified either to be serviced by the shipper's fleet or through auction. However, it is common in real-life problems that the same lane should be served multiple times during the planning horizon. In this study, the periodicity nature of the problem is incorporated into the SLSP. Thus, a novel variant of the problem, namely the Periodic SLSP (P-SLSP) is introduced. The aim is to achieve savings on the shipper transportation costs over the extended horizon. The problem is modeled as an integer programming formulation and solved first with a general purpose software. Subsequently, three different heuristic methods have been developed to overcome the limitation of the exact full-space method. The validity of the model as well as the efficiency of the heuristics have been tested by using a properly modified set of Solomon's benchmark problems. Intensive computational analysis indicates the appropriateness of the proposed heuristics and their relevance for solving large-scale P-SLSPs.

Original languageEnglish
Pages (from-to)182-191
Number of pages10
JournalComputers and Industrial Engineering
Volume106
DOIs
Publication statusPublished - Apr 1 2017

Fingerprint

Heuristic methods
Integer programming
Planning
Costs

Keywords

  • Auctions
  • Shipper Lane Selection Problem
  • Simulated annealing
  • Synergy
  • Transportation procurement

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Heuristic methods for the periodic Shipper Lane Selection Problem in transportation auctions. / Triki, Chefi; Mirmohammadsadeghi, Seyedmehdi; Piya, Sujan.

In: Computers and Industrial Engineering, Vol. 106, 01.04.2017, p. 182-191.

Research output: Contribution to journalArticle

@article{f75eafd340184b5c9f2f669353bece76,
title = "Heuristic methods for the periodic Shipper Lane Selection Problem in transportation auctions",
abstract = "In the Shipper Lane Selection Problem (SLSP) a set of lanes should be classified either to be serviced by the shipper's fleet or through auction. However, it is common in real-life problems that the same lane should be served multiple times during the planning horizon. In this study, the periodicity nature of the problem is incorporated into the SLSP. Thus, a novel variant of the problem, namely the Periodic SLSP (P-SLSP) is introduced. The aim is to achieve savings on the shipper transportation costs over the extended horizon. The problem is modeled as an integer programming formulation and solved first with a general purpose software. Subsequently, three different heuristic methods have been developed to overcome the limitation of the exact full-space method. The validity of the model as well as the efficiency of the heuristics have been tested by using a properly modified set of Solomon's benchmark problems. Intensive computational analysis indicates the appropriateness of the proposed heuristics and their relevance for solving large-scale P-SLSPs.",
keywords = "Auctions, Shipper Lane Selection Problem, Simulated annealing, Synergy, Transportation procurement",
author = "Chefi Triki and Seyedmehdi Mirmohammadsadeghi and Sujan Piya",
year = "2017",
month = "4",
day = "1",
doi = "10.1016/j.cie.2017.02.005",
language = "English",
volume = "106",
pages = "182--191",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Heuristic methods for the periodic Shipper Lane Selection Problem in transportation auctions

AU - Triki, Chefi

AU - Mirmohammadsadeghi, Seyedmehdi

AU - Piya, Sujan

PY - 2017/4/1

Y1 - 2017/4/1

N2 - In the Shipper Lane Selection Problem (SLSP) a set of lanes should be classified either to be serviced by the shipper's fleet or through auction. However, it is common in real-life problems that the same lane should be served multiple times during the planning horizon. In this study, the periodicity nature of the problem is incorporated into the SLSP. Thus, a novel variant of the problem, namely the Periodic SLSP (P-SLSP) is introduced. The aim is to achieve savings on the shipper transportation costs over the extended horizon. The problem is modeled as an integer programming formulation and solved first with a general purpose software. Subsequently, three different heuristic methods have been developed to overcome the limitation of the exact full-space method. The validity of the model as well as the efficiency of the heuristics have been tested by using a properly modified set of Solomon's benchmark problems. Intensive computational analysis indicates the appropriateness of the proposed heuristics and their relevance for solving large-scale P-SLSPs.

AB - In the Shipper Lane Selection Problem (SLSP) a set of lanes should be classified either to be serviced by the shipper's fleet or through auction. However, it is common in real-life problems that the same lane should be served multiple times during the planning horizon. In this study, the periodicity nature of the problem is incorporated into the SLSP. Thus, a novel variant of the problem, namely the Periodic SLSP (P-SLSP) is introduced. The aim is to achieve savings on the shipper transportation costs over the extended horizon. The problem is modeled as an integer programming formulation and solved first with a general purpose software. Subsequently, three different heuristic methods have been developed to overcome the limitation of the exact full-space method. The validity of the model as well as the efficiency of the heuristics have been tested by using a properly modified set of Solomon's benchmark problems. Intensive computational analysis indicates the appropriateness of the proposed heuristics and their relevance for solving large-scale P-SLSPs.

KW - Auctions

KW - Shipper Lane Selection Problem

KW - Simulated annealing

KW - Synergy

KW - Transportation procurement

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

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

U2 - 10.1016/j.cie.2017.02.005

DO - 10.1016/j.cie.2017.02.005

M3 - Article

VL - 106

SP - 182

EP - 191

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -