Omega-international Journal of Management Science最新文献

Co-creation has become popular in experience good markets as it can resolve the uncertainty of the mismatch between product attributes and customer preferences. This paper delves into an examination of how firms strategize product co-creation with their customers in a competitive duopoly context, all the while taking into account the potential product return stemming from mismatch uncertainty. Results show that when the launching cost is moderate and the customer’s participation cost is relatively small, an asymmetric equilibrium with one firm launching the project and the other not is reached; otherwise, both firms adopt co-creation or not, conditional on the launching cost. Besides, firms may fall into a prisoner’s dilemma in which both firms launch the project when the launching cost is moderate. Furthermore, it is shown that co-creation functions as an effective way for firms to escape the Bertrand trap and reap the benefits of the product’s high valuation. Additionally, there is a mutual influence between co-creation and product return. A higher product return cost incentivizes firms to embrace co-creation, but meanwhile, it makes them more susceptible to falling into a prisoner’s dilemma scenario. In a state of equilibrium, co-creation consistently diminishes the product return for the firm engaging in it. Particularly, the firm not providing co-creation can take a free ride on the competitor’s co-creation benefits in reducing product return when the return cost is relatively large. Lastly, the value of co-creation can be amplified through the implementation of a price discrimination strategy, particularly when the participation cost is relatively large.

In this study we investigate whether the preference for deliberate and deep information processing, also known as epistemic motivation, affects an important feature of model-driven decision support practice, namely, to serve as an aid to surface and manage cognitive conflict within the group. We report on an experimental study that adopts a process-oriented methodology to examine the conflict management behaviours and trajectories of groups high and low in epistemic motivation. Our findings reveal that groups exhibited a variety of patterns of conflict management despite using the same model-driven decision support approach. In addition, three facets of epistemic motivation (discomfort with ambiguity, decisiveness, preference for order and structure) were significant co-variates of the variance in groups’ conflict management trajectories. Notably, only a small proportion of groups high in epistemic motivation were able to confront their conflict and resolve it in positive ways. Our findings have significant implications for the theory and practice of model-driven decision support.

The popularity of bike-sharing systems has constantly increased throughout the recent years. Most of such success can be attributed to their multiple benefits, such as user convenience, low usage costs, health benefits and their contribution to environmental relief. However, satisfying all user demands remains a challenge, given that the inventories of bike-sharing stations tend to be unbalanced over time. Bike-sharing system operators must therefore intervene to rebalance station inventories to provide both available bikes and empty docks to the commuters. Due to limited rebalancing resources, the number of stations to be rebalanced often exceeds the system’s rebalancing capacity, especially close to peak hours. As a consequence, operators are forced to manually select a subset of stations that should be prioritized for rebalancing. While most of the literature has concentrated either on predicting optimal station inventories or on the rebalancing itself, the identification of critical stations that should be prioritized for rebalancing has received little attention. Given the importance of this step in current operating practices, we propose three strategies to select the stations that should be prioritized for rebalancing, using features such as the predicted trip demand and the inventory levels at the stations themselves. Two sets of computational experiments aim at evaluating the performance of the proposed prioritization strategies on real-world data from Montreal’s bike-sharing system operator. The first set of experiments focuses on both the 2019 and 2020 seasons, each of which exhibits distinct travel patterns given the restrictive measures implemented in 2020 to prevent the spread of COVID-19. One of these strategies significantly improves by reducing the estimated lost demand by up to 65%, while another strategy reduces the estimated number of required rebalancing operations by up to 33% when compared to the prioritization scheme currently in use at the considered bike-sharing system. The second set of experiments evaluates the performance of the proposed strategies when rebalancing decisions are optimized in a rolling horizon planning. The results highlight various benefits of the proposed strategies, which are efficiently solved as transportation problems and improve lost demand over two intuitive baselines.

As a humanity crisis, the tragedy of forced displacement entails relief aid distribution efforts among en route refugee to alleviate their migration hardships. This study aims to assist humanitarian organizations in cost-efficiently optimizing the logistics of capacitated mobile facilities utilized to deliver relief aid to transiting refugees in a multi-period setting. The problem is referred to as the Capacitated Mobile Facility Location Problem with Mobile Demands (CMFLP-MD). In CMFLP-MD, refugee groups follow specific paths, and meanwhile, they receive relief aid at least once every fixed number of consecutive periods, maintaining continuity of service. To this end, the overall costs associated with capacitated mobile facilities, including fixed, service provision, and relocation costs, are minimized. We formulate a mixed integer linear programming (MILP) model and propose two solution methods to solve this complex problem: an accelerated Benders decomposition approach as an exact solution method and a matheuristic algorithm that relies on an enhanced fix-and-optimize agenda. We evaluate our methodologies by designing realistic instances based on the Honduras migration crisis that commenced in 2018. Our numerical results reveal that the accelerated Benders decomposition excels MILP with a 46% run time improvement on average while acquiring solutions at least as good as the MILP across all instances. Moreover, our matheuristic acquires high-quality solutions with a 2.4% average gap compared to best-incumbents rapidly. An in-depth exploration of the solution properties underscores the robustness of our relief distribution plans under varying migration circumstances. Across several metrics, our sensitivity analyses also highlight the managerial advantages of implementing CMFLP-MD solutions.

The Pairwise Comparison Table for the Deck of Cards Method enables the elicitation of preference parameters through an interactive process between an analyst and a Decision-Maker (DM). As in other preferences elicitation processes in Multiple Criteria Decision Aiding (MCDA) problems, this methodology can result in several inconsistent judgments. One way to address this concern is to use Linear Programming (LP) techniques to find solutions that minimize the number of initial inconsistent judgments that must be modified to restore consistency. However, since this approach does not allow further differentiating solutions, it can be inefficient in decision problems with multiple inconsistent information and several distinct solutions to overcome such inconsistencies. To enhance the decision-making process and to suggest solutions based on enriched information, we propose a new procedure for addressing inconsistent judgments based on two additional criteria to complement the minimum cardinality criterion. While the first additional criterion concerns the confidence level of the DM in their initial judgments, the second seeks to minimize the modifications made to the initial judgments to distort them as little as possible. Solving the three criteria in a specific LP-based lexicographic order defined by the DM makes it possible to determine a comprehensive ranking of eligible solutions to restore consistency. Proposing these solutions to the DM according to their position in the ranking enables revising the initial inconsistent judgments more efficiently. The new methodology also considers the possibility of missing confidence information, which can decrease the cognitive effort of the DM in real-world decision problems when eliciting preferences.

Additive manufacturing technology can enable low-cost, efficient production of low-demand, highly-complex customized items with reduced lead time if production is judiciously planned. This paper addresses the assignment of requested items into batches and the scheduling of the batches onto 3D printers. The objective is to minimize the manufacturing makespan while satisfying items’ compatibility, two-dimensional no-overlap and containment packing constraints within a batch, and machine’s capability to manufacture a batch. The problem is modeled as a mixed integer linear program (MIP) that solves instances up to 100 items. For hard and large instances, this paper proposes a matheuristic that fathoms packings using a step-wise check procedure. Computational results reveal that the proposed heuristic improves the makespan of MIP solutions of hard instances by 12% on average, with improvements reaching up to 72% for instances with 150 items. They further show that the proposed heuristic finds the best makespan for 88% of all cases. Finally, we provide useful managerial insights for production flexibility and scheduling policies.

In dense urban rail networks with high passenger demands, uncertain disturbances occur frequently, and the resulting train delays will likely spread over the whole network rapidly, hence degrading the service quality offered to passengers. To cope with the uncertainties of frequent disturbances in urban rail networks, this paper proposes a robust train regulation strategy based on the information gap decision theory, which allows the operators to adjust the conservativeness of adjustment schemes flexibly by varying system performances but without the need for prior knowledge of uncertain disturbances. Specifically, considering the coupling relationship between train dynamic flows and passenger dynamic flows, a mixed integer quadratically constrained programming (MIQCP) model is constructed for the robust train regulation problem to generate solutions with immunity against disturbance uncertainties, in which the envelope-bound model is used to characterizing the uncertain sets of disturbances. To meet the real-time requirements of train operation adjustment, a tailored outer approximation algorithm incorporating a two-phase heuristics method is devised to effectively solve the developed robust train regulation model, thereby quickly generating high-quality solutions. Moreover, the warm start technique and domain reduction technique are carefully developed to accelerate the solving procedure. Numerical experiments based on the Beijing metro network illustrate the robustness of the proposed train regulation strategies and the effectiveness of the designed solution approach.

Although the benchmarking literature has amassed both theoretical developments and empirical evidence on the performance of DMUs, the void related to the learning perspective of benchmarking remains to be filled. Further required methodological and empirical justifications aiming to fill this gap, are presented in this paper. Specifically, the mechanisms of knowledge transfer among the examined entities and the identification of the most influential source of learning require further investigation. We introduce a novel heuristic algorithm based on the Peer Removal to Improve Mean Efficiency in a Data Envelopment Analysis context to explore knowledge transfer within a benchmarking set. Based on sequential re-modifications of the technology following the removal of knowledge transmitters, a taxonomy arises including the role models, the knowledge receivers and the minimum efficiency DMU. Knowledge transfer is quantified by the calculation of the learning trace, following the removal of knowledge transmitters. We employ the most productive scale size to identify the most influential unit in terms of knowledge contribution. Findings from an illustrative example and a case study on European regions indicate that knowledge flows are not equally strong across benchmarking rounds.

Crowd-shipping is a last-mile delivery concept in which commuters pick up and deliver parcels on their pre-existing paths. In urban areas, crowd-shipping circumvents problems that traditional last-mile delivery systems suffer from, such as road congestion and lack of parking spaces, especially if more sustainable modes of transport are utilized, like bikes or e-bikes. Using transfers between crowd-shippers allows for expanding the service area and improving the overall performance. However, as this requires synchronization over space and time, it makes the problem more complex. In this work, we develop a model that can encompass fully heterogeneous crowd-shippers and parcels. Thereby, it allows for both direct time-synchronized transfers as well as intermediate storage at designated parcel lockers. We design a column generation algorithm to solve large-scale realistic instances to optimality. We extend the problem to allow crowd-shippers to carry multiple parcels at the same time and for this, we extend the algorithm to simultaneous column and row generation. We evaluate the performance of our algorithm as well as the potential of crowd-shipping with transfers on a realistic case study of a bike-based crowd-shipping system in Washington DC. Our methods solve realistic instances with 1000 crowd-shippers and 1000 parcels within minutes. The results show that a gain in revenue and service level of 30% can be obtained by allowing transfers. By letting part of the population of crowd-shippers carry two or three parcels at the same time, the revenue and service level can be further increased by 30 to 50%. Maximum locker capacities are shown to be reasonable and are the highest in areas where there is a large gap between the moment when parcels are dropped off and when they are picked up from parcel points, which are mainly in the city center.

Once effective vaccines are discovered for a pandemic and initial distribution infrastructure, and mechanisms are implemented, the next concern is an optimal vaccination campaign to stop the disease or minimize the casualties. This paper studies the optimization of a Vaccine Distribution Network (VDN) through a single-objective Mixed-Integer Non-Linear Programming (MINLP) model for minimizing the total cost in terms of governmental aid (to maintain the economy), logistics, vaccination, and hospitalization costs. The proposed model develops the optimal joint vaccination-quarantine strategy under equity considerations to (1) determine the optimal allocation of available vaccine stockpiles to different population classes in different regions and (2) seek to impose quarantine restrictions to different regions optimally. The proposed model was applied to a real case study, the vaccine distribution network in France. Through a comprehensive numerical analysis, the optimal vaccine allocation is calculated, and the impact of equity and quarantine on the performance of the distribution network is investigated. Moreover, fractional dosing on the number of infections is examined. The results show that equity considerations, counter-intuitively, lead to an increased number of infections. Furthermore, it is illustrated that fractional dosing helps policymakers to control the pandemic better under a limited supply of vaccines.