A new upper bound for routing problem with due date
© 2019, Computers and Industrial Engineering. All rights reserved. This research addresses the routing problem (RP) where the customer in each node has a due date, making it an extension of the classic routing problem. The objective function is to find a route that minimizes the number of nodes with...
Saved in:
Main Authors: | , |
---|---|
格式: | Conference Proceeding |
出版: |
2020
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079511668&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67758 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|