APA (7th ed.) Citation

Mahmoudi, M., & Zhou, X. (2016). Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations. Transportation research. Part B: methodological, 89, 19-42. https://doi.org/10.1016/j.trb.2016.03.009

Chicago Style (17th ed.) Citation

Mahmoudi, Monirehalsadat, and Xuesong Zhou. "Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State–space–time Network Representations." Transportation Research. Part B: Methodological 89 (2016): 19-42. https://doi.org/10.1016/j.trb.2016.03.009.

MLA (9th ed.) Citation

Mahmoudi, Monirehalsadat, and Xuesong Zhou. "Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State–space–time Network Representations." Transportation Research. Part B: Methodological, vol. 89, 2016, pp. 19-42, https://doi.org/10.1016/j.trb.2016.03.009.