2019•IOP Conference Series Materials Science and EngineeringOpen access

A new metaheuristics for solving vehicle routing problem: Partial Comparison Optimization

Antono Herry Purnomo Adhi, Budi Santosa, Nurhadi Siswanto

Abstract

Abstract Vehicle Routing Problem (VRP) is a problem of selecting shortest route from a depot to serve several nodes by considering transport capacity. In this study, a new metaheuristcs algorithm is proposed to solve VRP in order to achieve optimal solution. This metaheuristics algorithm is Partial Comparison Optimization (PCO). This new optimization algorithm was developed to solve combinatorial optimization problems such as VRP. In this study, PCO was tested to solve the problems that existed in the origin VRP. To prove PCO is a good metaheuristics for solving VRP, several of instances of symmetrical VRP were selected from the VRP library to evaluate its performance. The numerical results obtained from the calculation indicated that the proposed optimization method could achieve results that almost similar with the best-known solutions within a reasonable time calculation. It showed that PCO was a good metaheuristics to solve VRP.

Open-access reader

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, Metaheuristic, Mathematical optimization, Computer science, Optimization problem, Routing (electronic design automation), Mathematics, Combinatorial optimization