Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Search research articles

Related Experiment Videos

The adult training centre problem: a case study.

C Okonjo-Adigwe

The Journal of the Operational Research Society

|June 8, 1989

Summary

This summary is machine-generated.

Researchers optimized vehicle routes for a real-world problem, similar to the multiple travelling-salesman problem. They determined the best daily routes for four vehicles servicing 38 locations using advanced algorithms.

Related Experiment Videos

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same journal

Inferred Attractiveness Gravity-Based Models for Estimating Realized Access at Rural Hospitals.

The Journal of the Operational Research Society·2025

Same journal

Managing the social amplification of risk: a simulation of interacting actors.

The Journal of the Operational Research Society·2020

Same journal

Applications of simulation within the healthcare context.

The Journal of the Operational Research Society·2020

Same journal

An analysis of sources of risk in the consumer electronics industry.

The Journal of the Operational Research Society·2020

Same journal

The impact of teaching on hospital costs: a budgetary approach to non-market institutions.

The Journal of the Operational Research Society·1989

Same journal

Equity and access: exploring the effects of hospital location on the population served--a case study in strategic planning.

The Journal of the Operational Research Society·1989

See all related articles

Area of Science:

Operations Research
Logistics Management
Combinatorial Optimization

Background:

Real-world logistics often involve complex routing challenges.
The multiple travelling-salesman problem (mTSP) is a common NP-hard problem in vehicle routing.
Efficiently servicing multiple locations with limited vehicles is crucial for operational efficiency.

Purpose of the Study:

To find an optimal solution for a practical routing problem with mTSP characteristics.
To determine the most efficient daily routes for four service vehicles visiting 38 distinct locations.
To apply a combination of heuristic and exact algorithms for route optimization.

Main Methods:

Formulated the problem as a variation of the multiple travelling-salesman problem.
Employed a hybrid approach combining heuristic and exact algorithms.
Developed algorithms to determine the optimal sequence of visits for 38 locations.

Main Results:

An optimal routing solution was successfully identified for the specified scenario.
The study demonstrates the effectiveness of combined algorithmic approaches for complex routing.
The derived routes aim to minimize travel distance and time for daily vehicle services.

Conclusions:

The integration of heuristic and exact algorithms provides an effective method for solving real-world mTSP instances.
Optimized routing significantly enhances the efficiency of daily logistics operations.
This approach offers a scalable solution for businesses managing multi-vehicle delivery or service networks.