Heuristic approach for balanced allocation problem in logistics: a comparative study (Q2627297): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 08:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristic approach for balanced allocation problem in logistics: a comparative study |
scientific article |
Statements
Heuristic approach for balanced allocation problem in logistics: a comparative study (English)
0 references
31 May 2017
0 references
Summary: The core issue of this paper is efficient balancing of allocation of customers among multiple distribution centres. Allocation involves clustering of customers in such a way that the associated resources in terms of cost and time are minimal. Ready solution to this problem could be through non-deterministic polynomial (NP)-hard type model. But NP-hard type model is inherently time consuming in arriving at an optimal solution. This paper compares the meta-heuristic genetic algorithm with an improvised heuristic scheme developed from the 2-opt heuristic model. Possible solutions for efficient clustering of customers are then proposed.
0 references
logistics
0 references
balanced allocation
0 references
GAs
0 references
genetic algorithms
0 references
2-opt heuristic
0 references
improvement heuristics
0 references
allocation balancing
0 references
multiple distribution centres
0 references
customer clustering
0 references