2012•Advanced materials researchOpen access

The Research about Simulated Annealing Ant Colony Algorithm in Emergency Logistics Path Optimization

Li Yi Zhang, Teng Fei, Yun Shan Sun

Abstract

Emergency logistics distribution, as an important role, is the key to the whole logistics. Emergency logistics is mainly reflected in emergency. For the disaster, economic benefit is not the first thing to be thought about. High efficiency is the key to emergency logistics. This article concentrates on path optimization of emergency logistics distribution. Propose emergency logistics distribution path optimization model which considers timeliness as the first goal. Utilize Simulated Annealing Ant Colony Algorithm to search for optimization. Based on simulation, Simulated Annealing Ant Colony Algorithm owns better timeliness to solve emergency logistics distribution.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 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: Ant colony optimization algorithms, Simulated annealing, Path (computing), Key (lock), Computer science, Ant colony, Emergency rescue, Operations research