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: | P. Saksuriya, C. Likasiri |
---|---|
Format: | Conference Proceeding |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079511668&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67758 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Multiple depot vehicle routing problem with split delivery
by: Pitchaya Pongmanawut, et al.
Published: (2020) -
Solving Selfish Routing Problems with Involuntary Movements and Bounded Rationality
by: VARAKANTHAM, Pradeep Reddy, et al.
Published: (2014) -
New upper and lower bounds line of sight path loss model for mobile propagation in buildings
by: Supachai Phaiboon, et al.
Published: (2018) -
An improvement on the upper bounds of the partial derivatives of NURBS surfaces
by: Tian, Ye, et al.
Published: (2021) -
Functional area lower bound and upper bound on multicomponent selection for interval scheduling
by: Shen, Zhao Xuan, et al.
Published: (2010)