| Research Title |
A Study on the Optimization Algorithm for Solving the Supermarket Shopping Path
Problem |
| Date of Distribution |
13 September 2018 |
| Conference |
| Title of the Conference |
2018 3rd International Conference on Computer and Communication Systems (ICCCS) |
| Organiser |
IEEE and Nagoya Institute of Technology |
| Conference Place |
Nagoya Institute of Technology, Nagoya, Japan |
| Province/State |
|
| Conference Date |
27 April 2018 |
| To |
30 April 2018 |
| Proceeding Paper |
| Volume |
2018 |
| Issue |
- |
| Page |
Page(s):11 - 15 |
| Editors/edition/publisher |
|
| Abstract |
Finding shopping path is a key of solving customers
who make decision to purchase items and spend time to
shopping. The problem of store layout is the length of path for
how long a customer walks around in the store. This paper
studies the optimization algorithm to apply for solving the
supermarket shopping path problem which comparison the
popular optimization algorithms which are Genetic algorithm
(GA) and Simulated Annealing (SA). The experimental result
shows GA has been suitable in solving shopping path both of
supermarket where have the single entry-exit door or single
entry and multi-exit door. In addition, the processing time of
GA is better than SA. The contribution of this study has been
discovered as and effective optimization method in evaluating
the shopping path for supermarket and consideration the item
to allocate shelve planning. |
| Author |
|
| Peer Review Status |
มีผู้ประเมินอิสระ |
| Level of Conference |
นานาชาติ |
| Type of Proceeding |
Full paper |
| Type of Presentation |
Oral |
| Part of thesis |
true |
| Presentation awarding |
false |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย