Multi-Objective Location-Inventory-Routing Problem Based on Time-satisfaction Degree

摘要：

　　Most of work about Location-Inventory-Routing Problem (LIRP) focuses on some constraints but ignoring the time factor.However, it may lead to short-sighted decisions and cannot meet the time response requirements of retailers.Thus, this paper devoted to optimize of LIRP and take the retailers time-satisfaction degree into account.To solve this NP-hard problem, we introduce hybrid genetic simulated annealing algorithm (HGSAA) which hybridizes genetic algorithm and simulated annealing to solve this problem.Also, the computational results on test instance from the literature show the validity and generality of the heuristic algorithm, and the proposed model is very.useful to help managers make the right decisions under tougher competition.

关键词： Location-Inventory-Routing Problem time-satisfaction degree heuristic algorithm

作者: Jun FAN Xiao-fang TIAN Shuai DENG Hao GUO Zeng-lei ZHANG

作者单位: Department of Management Wuhan ordnance Non-Commissioned Officers Academy, Wuhan, China College of Resources and Environmental Engineering, Hubei University of Technology, Wuhan, China School of Economic Management, Hunan Institute of Technology, Hengyang, Wuhan, China School of Information Management, Central China Normal University, Wuhan, China

会议类型: 国际会议

会议名称: The 6th International Conference on Logistics and Supply Chain Management 2016(第六届物流工程与供应链管理国际研讨会)

会议地点: 长沙

会议语种:英文

页码: 295-303

在线出版日期: 2016-12-01（万方平台首次上网日期，不代表论文的发表时间）