2008•Logistics Sci-techRequires access

Model and Its Genetic Algorithm Design of the Vehicle Routing Problem for Distribution Center

MA Dong-yan

Abstract

This paper considers the vehicle scheduling problem in distribution center, and using the method of mixed integer programming to build the mathematical model. By analyzing the characteristics of the problem, a genetic algorithm is presented. Secondly, computational experiments are given to select the optimal parameters of the algorithm, and then optimal genetic algorithm is determined. Finally, computational tests are further given to show the efficiency of the algorithm.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Vehicle routing problem, Genetic algorithm, Mathematical optimization, Integer programming, Computer science, Algorithm, Scheduling (production processes), Estimation of distribution algorithm