Heuristic methods for the periodic Shipper Lane Selection Problem in transportation auctions
| Autor: | Seyedmehdi Mirmohammadsadeghi, Sujan Piya, Chefi Triki |
|---|---|
| Přispěvatelé: | Triki, Chefi, Mirmohammadsadeghi, Seyedmehdi, Piya, Sujan |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
050210 logistics & transportation
Engineering Mathematical optimization 021103 operations research General Computer Science business.industry Heuristic 05 social sciences 0211 other engineering and technologies General Engineering Time horizon 02 engineering and technology Set (abstract data type) 0502 economics and business Simulated annealing Benchmark (computing) Common value auction Shipper Lane Selection Problem Transportation procurement Auctions Synergy Simulated annealing Heuristics business Integer programming |
| Popis: | Shipper Lane Selection Problem in transportation procurement auctions.Periodicity condition in the integer programming formulation.Heuristics based on the decomposition approach to solve large-scale problems.Extensive experimental analysis on benchmark test problems.Comparison with the state-of-the-art models and sensitivity analysis. In the Shipper Lane Selection Problem (SLSP) a set of lanes should be classified either to be serviced by the shippers 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 Solomons benchmark problems. Intensive computational analysis indicates the appropriateness of the proposed heuristics and their relevance for solving large-scale P-SLSPs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|