loading
Papers

Research.Publish.Connect.

Paper

Authors: Elham Mamaghani ; Haoxun Chen and Christian Prins

Affiliation: Industrial Systems Optimization Laboratory, Charles Delaunay Institute and UMR CNRS 6281, University of Technology of Troyes, Troyes 10004 and France

ISBN: 978-989-758-352-0

Keyword(s): Carrier Collaboration, Bid Generation, Periodic Vehicle Routing Problem, Pickup and Delivery, Profit.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; e-Business ; Enterprise Information Systems ; Industrial Engineering ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Logistics ; Management Sciences ; Methodologies and Technologies ; Operational Research ; Optimization ; OR in Transportation ; Pattern Recognition ; Routing ; Scheduling ; Software Engineering ; Symbolic Systems

Abstract: In this article, a new vehicle routing problem appeared in carrier collaboration via a combinatorial auction (CA) is studied. A carrier with reserved requests wants to determine within a time horizon of multi periods (days) which requests to serve among a set of selective requests open for bid of the auction to maximize its profit. In each period, the carrier has a set of reserved requests that must be served by the carrier itself. Each request is specified by a pair of pickup and delivery locations, a quantity, and two time windows for pickup and delivery respectively. The objective of the carrier is to determine which selective requests may be served in each period in addition of its reserved requests and determine optimal routes to serve the reserved and selective requests to maximize its total profit. For this NP-hard problem, a mixed-integer linear programming model is formulated and a genetic algorithm combined with simulated annealing is proposed. The algorithm is evaluated on instances with 6 to 100 requests. The computational results show this algorithm significantly outperform CPLEX solver, not only in computation time but also in solution quality. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.204.48.199

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Mamaghani, E.; Chen, H. and Prins, C. (2019). A Hybrid Genetic and Simulation Annealing Approach for a Multi-period Bid Generation Problem in Carrier Collaboration.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 307-314. DOI: 10.5220/0007369203070314

@conference{icores19,
author={Elham Jelodari Mamaghani. and Haoxun Chen. and Christian Prins.},
title={A Hybrid Genetic and Simulation Annealing Approach for a Multi-period Bid Generation Problem in Carrier Collaboration},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={307-314},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007369203070314},
isbn={978-989-758-352-0},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Hybrid Genetic and Simulation Annealing Approach for a Multi-period Bid Generation Problem in Carrier Collaboration
SN - 978-989-758-352-0
AU - Mamaghani, E.
AU - Chen, H.
AU - Prins, C.
PY - 2019
SP - 307
EP - 314
DO - 10.5220/0007369203070314

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.