Vehicle Routing Problem with Weight Coefficients and Stochastic Demands Based on the Cross-Entropy Method

Author

Qiu Yue

Author_Institution

Inf. Coll., Capital Univ. of Economic & Bus., Beijing, China

fYear

2009

fDate

5-6 Dec. 2009

Firstpage

159

Lastpage

162

Abstract

The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on cross-entropy is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic Demands (WVRPSD) with weight coefficients and stochastic demands. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.

Keywords

combinatorial mathematics; entropy; optimisation; stochastic processes; transportation; vehicles; NP problem; combinatorial optimization; cross-entropy method; multi-extremal optimization; rare event simulation; stochastic demands; vehicle routing problem; weight coefficients; Computer security; Costs; Discrete event simulation; Entropy; Fuel economy; NP-hard problem; Routing; Stochastic processes; Transportation; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communications Security, 2009. ICCCS '09. International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-0-7695-3906-5

Electronic_ISBN

978-1-4244-5408-2

Type

conf

DOI

10.1109/ICCCS.2009.20

Filename

5380267