A Bio-Inspired Algorithm for the Fleet Size and Mix Vehicle Routing Problem
The fleet size and mix vehicle routing problem (FSMVRP) is a class of combinatorial optimization problem with wide-ranging applications in practice. The purpose of this problem is to manage the routes as well as the type of vehicles. In this paper, we apply a bio-inspired algorithm
based on the concept of membrane computing (named BIBMA) to solve FSMVRP. In BIBMA, a cell-like framework and rules such as updating rules, communication rules, recording rules and selecting rules, are combined to improve the algorithm's global search capacities. We tested our method on several
benchmark functions of FSMVRP, including 12 instances with fixed cost and 8 instances without fixed cost. Simulation results show that the proposed algorithm is valid to solve FSMVRP for high quality results.
Keywords: CELL-LIKE FRAMEWORK; FLEET SIZE; MEMBRANE ALGORITHM; MEMBRANE SYSTEMS; MIX VEHICLE ROUTING PROBLEM
Document Type: Research Article
Publication date: 01 October 2014
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content