Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

Evolutionary analysis of sustainable tourism

“…Dynamic game theory mainly studies the decision behavior among participants by considering the time factor in sequential, differential, evolutionary, repeated, and stochastic games. This theory has been widely used to investigate the pricing decisions in the field of operational management (Baldacci et al, 2017;. Some researchers have employed the dynamic game method to discuss the game behavior among tourism stakeholders (Huang et al, 2010;Yang et al, 2015;Zyl, 2012).…”

Last mile delivery routing problem using autonomous electric vehicles

“…Moreover, there are two main solution approaches for Cm-RSP, including exact and metaheuristics. The works proposing exact solvers for Cm-RSP are as follows: branch-and-cut (Baldacci et al, 2007), Column Generation (Hoshino & Souza, 2008), branch-and-cut-and-price (Fouilhoux & Questel, 2014a;Hoshino & de Souza, 2009;Hoshino & De Souza, 2012), branch-and-cut (Berinsky & Zabala, 2011), Dynamic programming (Baldacci, Hill, Hoshino & Lim, 2017). Also, heuristic/metaheuristic works on Cm-RSP consist of Heuristic algorithms (Naji Azimi, , IP-based Local Search , VNS with an IP-based improvement (Naji-Azimi, , Memetic Algorithm (MA) (Zhang, Qin & Lim, 2014), combined GRASP and Tabu Search (TS) (Mauttone, Nesmachnow, Olivera & Amoza, 2008), VNS (Franco, López-Santana & Mendez-Giraldo, 2016;.…”

Models and algorithms for last mile delivery problems with multiple shipping options

“…Some instances with up to 102 nodes are solved to optimality by both branch-and-cut (Baldacci et al, 2007) and branch-cut-and-price (Hoshino & De Souza, 2012). Baldacci et al (2017) propose pricing strategies based on dynamic programming algorithms for the CmRSP. Five different pricing strategies based on three different ring-star relaxations are presented.…”