loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: S. Kande 1 ; C. Prins 2 ; L. Belgacem 3 and B. Redon 3

Affiliations: 1 University of Technology of Troyes and FuturMaster, France ; 2 University of Technology of Troyes, France ; 3 FuturMaster, France

ISBN: 978-989-758-075-8

Keyword(s): Distribution network, Multi-Start Iterated Local Search, Local Search, Lot-sizing, Metaheuristic, Multi-echelon inventory, Multi-sourcing, Perishable product, Supply planning, Transport capacity, Variable neighborhood descent.

Related Ontology Subjects/Areas/Topics: Applications ; e-Business ; Enterprise Information Systems ; Industrial Engineering ; Logistics ; Methodologies and Technologies ; Operational Research ; Supply Chain Management

Abstract: This article presents a planning problem in a distribution network incorporating two levels inventory management of perishable products, lot-sizing, multi-sourcing and transport capacity with a homogeneous fleet of vehicles. A mixed integer linear programming (MILP) and a greedy heuristic were developed to solve this real planning problem. There are some instances for which the solver cannot give a good lower bound within the limited time and for other instances it takes a lot of time to solve MILP. The greedy heuristic is an alternative to the mixed integer linear program to quickly solve some large instances taking into account original and difficult constraints. For some instances the gap between the solutions of the solver (MILP) and the heuristic becomes quite significant. A multi-start iterated local search (MS-ILS), using the variable neighborhood descent (VND) and a greedy randomized heuristic, has been implemented. It has been included in an APS (Advanced Planning System) and compared with an exact resolution of the MILP. The instances are derived from actual data or built using a random generator of instances to have wider diversity for computational evaluation. The MS-ILS significantly improves the quality of solutions. (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.206.12.79

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:
Kande, S.; Prins , C.; Belgacem, L. and Redon, B. (2015). Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products.In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 294-303. DOI: 10.5220/0005224902940303

@conference{icores15,
author={S. Kande. and C. Prins . and L. Belgacem. and B. Redon.},
title={Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={294-303},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005224902940303},
isbn={978-989-758-075-8},
}

TY - CONF

JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products
SN - 978-989-758-075-8
AU - Kande, S.
AU - Prins , C.
AU - Belgacem, L.
AU - Redon, B.
PY - 2015
SP - 294
EP - 303
DO - 10.5220/0005224902940303

Login or register to post comments.

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