A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem | Zendy

Bach Lukas | Zendy; Lysgaard Jens | Zendy; Wøhlk Sanne | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem

Author(s) -

Bach Lukas,

Lysgaard Jens,

Wøhlk Sanne

Publication year - 2016

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.21690

Subject(s) - arc routing , benchmark (surveying) , mathematical optimization , computer science , routing (electronic design automation) , vehicle routing problem , destination sequenced distance vector routing , static routing , set (abstract data type) , link state routing protocol , mathematics , routing protocol , computer network , geodesy , programming language , geography

In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch‐and‐Cut‐and‐Price algorithm for obtaining optimal solutions to the problem and present computational results based on a set of standard benchmark instances. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(3), 161–184 2016

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research