Optimization of Regular Vehicle Routing Problems Based on Set Covering Models
| Autor: | Daisuke Naka, Kohei Asai, Masataka Seo, Ikuko Nishikawa, Kazutoshi Sakakibara |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Linear programming Heuristic (computer science) Computer science 020208 electrical & electronic engineering 02 engineering and technology Set (abstract data type) 020901 industrial engineering & automation Electric devices Vehicle routing problem 0202 electrical engineering electronic engineering information engineering Routing (electronic design automation) Focus (optics) Selection (genetic algorithm) |
| Zdroj: | 2018 57th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE). |
| DOI: | 10.23919/sice.2018.8492712 |
| Popis: | In this paper, we focus on regular vehicle routing problems, in which necessary amount of electric devices are delivered weekly from a central warehouse to a number of regional store by a fleet of vehicles. We develop an optimization method which derives weekly routing plans satisfying several kinds of routing constraints. In this method, a collection of candidate routes are generated by heuristic techniques and a set of the executed routes are selected by a mathematical programming technique based on a set covering model. It has an advantage of the computational costs by restricting the collection of the candidate routes for selection within the feasible and also promising ones. Through some numerical experiments using actual logistic instances and results, the effectiveness and possibility of our proposed method are examined. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|