Flow merging and hub route optimization in collaborative transportation (Q1714692): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59053818 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2014/621487 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040321302 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flow merging and hub route optimization in collaborative transportation |
scientific article |
Statements
Flow merging and hub route optimization in collaborative transportation (English)
0 references
1 February 2019
0 references
Summary: This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers' transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route could be acquired after paying fixed charges. The problem arises in the application of logistics, postal services, airline transportation, and so forth. We formulate the problem as a mixed-integer programming model, and provide two heuristic approaches, respectively, based on Lagrangian relaxation and Benders decomposition. Computational experiments show that the algorithms work well.
0 references
