A split delivery vehicle routing problem

Hiroaki Mohri, Mikio Kubo, Yasutoshi Yajima, Masao Mori

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We consider a standard vehicle routing problem, i.e. a routing problem where all nodes (customers) should be visited only once by only one vehicle and without exceeding a vehicle's capacity. The objective function minimizes total distance traveled. In this paper, we relax the first standard problem condition. We call this problem the Split Delivery Vehicle Routing Problem (SDVRP). The term "split delivery", means, as long as the total delivery equals the demand, the demand may be satisfied using more than one vehicle. Under the relaxed condition, we are able to reduce the number of vehicles and the total distribution cost (time). Hence, it will find practical application. SDVRP has been little researched. On a mathematical programming base, Suzuki et al. (1987) suggested an exact algorithm using a Branch and Bound Method for this problem. But it is only useful for a small number of nodes. On a local search base, Doror and Trudeau (1990) proposed heuristic algorithm. In this paper, we take another formulation. Solving this problem on mathematical programming base, we decompose it into two problems: First, a problem of which vehicle serves the node and to what extent each vehicle serves each node. Second, the problem of the route that each vehicle takes. This idea is based on Fisher and Jaikumar (1981) whose solutions is very good one for a standard vehicle routing problem. The second problem is the Traveling Salesman Problem. Therefore, the first problem is the essential one. We suggest that by method of Fisher (1985) we can generate a heuristic solution from the Lagrangean Solution for the first problem. From this we are able to solve a large size SDVRP.

Original languageEnglish
Pages (from-to)372-387
Number of pages16
JournalJournal of the Operations Research Society of Japan
Volume39
Issue number3
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Split delivery
Vehicle routing problem
Node
Mathematical programming
Distribution costs
Routing
Heuristics
Traveling salesman problem
Problem solving
Branch-and-bound
Local search
Heuristic algorithm
Objective function

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

A split delivery vehicle routing problem. / Mohri, Hiroaki; Kubo, Mikio; Yajima, Yasutoshi; Mori, Masao.

In: Journal of the Operations Research Society of Japan, Vol. 39, No. 3, 1996, p. 372-387.

Research output: Contribution to journalArticle

Mohri, H, Kubo, M, Yajima, Y & Mori, M 1996, 'A split delivery vehicle routing problem', Journal of the Operations Research Society of Japan, vol. 39, no. 3, pp. 372-387.
Mohri, Hiroaki ; Kubo, Mikio ; Yajima, Yasutoshi ; Mori, Masao. / A split delivery vehicle routing problem. In: Journal of the Operations Research Society of Japan. 1996 ; Vol. 39, No. 3. pp. 372-387.
@article{b2a412142f49427787811cc146f2a94d,
title = "A split delivery vehicle routing problem",
abstract = "We consider a standard vehicle routing problem, i.e. a routing problem where all nodes (customers) should be visited only once by only one vehicle and without exceeding a vehicle's capacity. The objective function minimizes total distance traveled. In this paper, we relax the first standard problem condition. We call this problem the Split Delivery Vehicle Routing Problem (SDVRP). The term {"}split delivery{"}, means, as long as the total delivery equals the demand, the demand may be satisfied using more than one vehicle. Under the relaxed condition, we are able to reduce the number of vehicles and the total distribution cost (time). Hence, it will find practical application. SDVRP has been little researched. On a mathematical programming base, Suzuki et al. (1987) suggested an exact algorithm using a Branch and Bound Method for this problem. But it is only useful for a small number of nodes. On a local search base, Doror and Trudeau (1990) proposed heuristic algorithm. In this paper, we take another formulation. Solving this problem on mathematical programming base, we decompose it into two problems: First, a problem of which vehicle serves the node and to what extent each vehicle serves each node. Second, the problem of the route that each vehicle takes. This idea is based on Fisher and Jaikumar (1981) whose solutions is very good one for a standard vehicle routing problem. The second problem is the Traveling Salesman Problem. Therefore, the first problem is the essential one. We suggest that by method of Fisher (1985) we can generate a heuristic solution from the Lagrangean Solution for the first problem. From this we are able to solve a large size SDVRP.",
author = "Hiroaki Mohri and Mikio Kubo and Yasutoshi Yajima and Masao Mori",
year = "1996",
language = "English",
volume = "39",
pages = "372--387",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "3",

}

TY - JOUR

T1 - A split delivery vehicle routing problem

AU - Mohri, Hiroaki

AU - Kubo, Mikio

AU - Yajima, Yasutoshi

AU - Mori, Masao

PY - 1996

Y1 - 1996

N2 - We consider a standard vehicle routing problem, i.e. a routing problem where all nodes (customers) should be visited only once by only one vehicle and without exceeding a vehicle's capacity. The objective function minimizes total distance traveled. In this paper, we relax the first standard problem condition. We call this problem the Split Delivery Vehicle Routing Problem (SDVRP). The term "split delivery", means, as long as the total delivery equals the demand, the demand may be satisfied using more than one vehicle. Under the relaxed condition, we are able to reduce the number of vehicles and the total distribution cost (time). Hence, it will find practical application. SDVRP has been little researched. On a mathematical programming base, Suzuki et al. (1987) suggested an exact algorithm using a Branch and Bound Method for this problem. But it is only useful for a small number of nodes. On a local search base, Doror and Trudeau (1990) proposed heuristic algorithm. In this paper, we take another formulation. Solving this problem on mathematical programming base, we decompose it into two problems: First, a problem of which vehicle serves the node and to what extent each vehicle serves each node. Second, the problem of the route that each vehicle takes. This idea is based on Fisher and Jaikumar (1981) whose solutions is very good one for a standard vehicle routing problem. The second problem is the Traveling Salesman Problem. Therefore, the first problem is the essential one. We suggest that by method of Fisher (1985) we can generate a heuristic solution from the Lagrangean Solution for the first problem. From this we are able to solve a large size SDVRP.

AB - We consider a standard vehicle routing problem, i.e. a routing problem where all nodes (customers) should be visited only once by only one vehicle and without exceeding a vehicle's capacity. The objective function minimizes total distance traveled. In this paper, we relax the first standard problem condition. We call this problem the Split Delivery Vehicle Routing Problem (SDVRP). The term "split delivery", means, as long as the total delivery equals the demand, the demand may be satisfied using more than one vehicle. Under the relaxed condition, we are able to reduce the number of vehicles and the total distribution cost (time). Hence, it will find practical application. SDVRP has been little researched. On a mathematical programming base, Suzuki et al. (1987) suggested an exact algorithm using a Branch and Bound Method for this problem. But it is only useful for a small number of nodes. On a local search base, Doror and Trudeau (1990) proposed heuristic algorithm. In this paper, we take another formulation. Solving this problem on mathematical programming base, we decompose it into two problems: First, a problem of which vehicle serves the node and to what extent each vehicle serves each node. Second, the problem of the route that each vehicle takes. This idea is based on Fisher and Jaikumar (1981) whose solutions is very good one for a standard vehicle routing problem. The second problem is the Traveling Salesman Problem. Therefore, the first problem is the essential one. We suggest that by method of Fisher (1985) we can generate a heuristic solution from the Lagrangean Solution for the first problem. From this we are able to solve a large size SDVRP.

UR - http://www.scopus.com/inward/record.url?scp=0001199997&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001199997&partnerID=8YFLogxK

M3 - Article

VL - 39

SP - 372

EP - 387

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 3

ER -