scholarly journals Optimal Pricing in Recycling and Remanufacturing in Uncertain Environments

2020 ◽  
Vol 12 (8) ◽  
pp. 3199
Author(s):  
Guangzhou Yan ◽  
Yaodong Ni ◽  
Xiangfeng Yang
Keyword(s):  
Historical Data ◽  
Programming Model ◽  
Optimal Pricing ◽  
Market Demand ◽  
Pricing Model ◽  
Uncertain Environments ◽  
Uncertainty Distribution ◽  
Equivalent Models ◽  
Fashion Products ◽  
Proposed Model

With the increasing awareness of environmental protection, firms pay much more attention to the recycling and remanufacturing of used products. This paper addresses the problem of the optimal pricing in recycling and remanufacturing in uncertain environments. We consider two strategies of remanufacturing products, by which a recycled product can be repaired and sold as a second-hand product or dissembled into materials for production of new products according to its quality. As the market demand for products and the quantities of recycled products, such as fashion products and mobile phones, usually lack historical data, this paper adopts uncertainty theory to depict uncertainty in establishing the pricing model. An uncertain programming model and a series of crisp equivalent models are proposed under the assumptions of particular uncertainty distribution. Finally, numerical experiments are performed to show how various parameters influence the results of the proposed model.

scholarly journals Optimal Pricing Decision of Fashion Apparel considering Experiential Service and Design Enhancement

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Qi Xu ◽  
Lili Zhou ◽  
Qi Chen
Keyword(s):  
Substitution Effects ◽  
Optimal Pricing ◽  
Selling Price ◽  
Market Demand ◽  
Complementarity Effect ◽  
Deterioration Rate ◽  
Pricing Decision ◽  
Proposed Model ◽  
Total Profit ◽  
Fashion Apparel

Fashionable clothing is susceptible to seasonality, fashion popularity, and other factors. The decline in the fashion level for fashion apparel will cause its market value to continuously decrease, reducing market demand and creating a backlog of apparel inventory. Under such a circumstance, the apparel retailer chooses to maintain the fashion of the goods by providing experiential services or enhancing product design capabilities. This paper focuses on the discussions on the issue of whether experience service and design efforts are complements or substitutes. The major objective is to simultaneously determine the experience service investment and the optimal selling price to maximize the total profit. First, a Cobb–Douglas utility function is used to derive a demand function that depends on the price and fashion level. Four kinds of inventory models are further established to obtain optimal pricing and inventory ordering strategies. Second, an algorithm is presented to search for the optimal solutions of the proposed model. Finally, a numerical example is provided to perform a sensitivity analysis of the key parameters and to discuss specific managerial insights. The numerical examples show that both the experiential services and the enhanced fashion design can effectively reduce the apparel company’s inventory and increase profits. When the two strategies are combined, they will produce complementary or substitution effects, which depend on the deterioration rate of the fashion level of the apparel. If the deterioration rate is less than a critical value, the interaction of experiential services and design investment has a complementarity effect.

scholarly journals Pricing Strategies of Logistics Distribution Services for Perishable Commodities

Algorithms ◽  
2018 ◽  
Vol 11 (11) ◽  
pp. 186
Author(s):  
Tao Li ◽  
Yan Chen ◽  
Taoying Li
Keyword(s):  
Dynamic Pricing ◽  
Consumer Satisfaction ◽  
Service Providers ◽  
Time Constraints ◽  
Optimal Pricing ◽  
Pricing Strategies ◽  
Pricing Model ◽  
Logistics Service ◽  
Distribution Services ◽  
Perishable Goods

The problem of pricing distribution services is challenging due to the loss in value of product during its distribution process. Four logistics service pricing strategies are constructed in this study, including fixed pricing model, fixed pricing model with time constraints, dynamic pricing model, and dynamic pricing model with time constraints in combination with factors, such as the distribution time, customer satisfaction, optimal pricing, etc. By analyzing the relationship between optimal pricing and key parameters (such as the value of the decay index, the satisfaction of consumers, dispatch time, and the storage cost of the commodity), it is found that the larger the value of the attenuation coefficient, the easier the perishable goods become spoilage, which leads to lower distribution prices and impacts consumer satisfaction. Moreover, the analysis of the average profit of the logistics service providers in these four pricing models shows that the average profit in the dynamic pricing model with time constraints is better. Finally, a numerical experiment is given to support the findings.

scholarly journals Wind Farm Cable Connection Layout Optimization with Several Substations

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3615
Author(s):  
Adelaide Cerveira ◽  
Eduardo J. Solteiro Pires ◽  
José Baptista
Keyword(s):  
Energy Production ◽  
Wind Farm ◽  
Programming Model ◽  
Optimal Solution ◽  
Wind Farms ◽  
Green Energy ◽  
Fossil Energy ◽  
Proposed Model ◽  
Short Time ◽  
Cable Connection

Green energy has become a media issue due to climate changes, and consequently, the population has become more aware of pollution. Wind farms are an essential energy production alternative to fossil energy. The incentive to produce wind energy was a government policy some decades ago to decrease carbon emissions. In recent decades, wind farms were formed by a substation and a couple of turbines. Nowadays, wind farms are designed with hundreds of turbines requiring more than one substation. This paper formulates an integer linear programming model to design wind farms’ cable layout with several turbines. The proposed model obtains the optimal solution considering different cable types, infrastructure costs, and energy losses. An additional constraint was considered to limit the number of cables that cross a walkway, i.e., the number of connections between a set of wind turbines and the remaining wind farm. Furthermore, considering a discrete set of possible turbine locations, the model allows identifying those that should be present in the optimal solution, thereby addressing the optimal location of the substation(s) in the wind farm. The paper illustrates solutions and the associated costs of two wind farms, with up to 102 turbines and three substations in the optimal solution, selected among sixteen possible places. The optimal solutions are obtained in a short time.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

Cuckoo optimization algorithm in reverse logistics: A network design for COVID-19 waste management

2021 ◽  
pp. 0734242X2110039
Author(s):  
Elham Shadkam
Keyword(s):  
Waste Management ◽  
Network Design ◽  
Optimization Algorithm ◽  
Reverse Logistics ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Fixed Costs ◽  
Logistics System ◽  
Cuckoo Optimization Algorithm ◽  
Proposed Model

Today, reverse logistics (RL) is one of the main activities of supply chain management that covers all physical activities associated with return products (such as collection, recovery, recycling and destruction). In this regard, the designing and proper implementation of RL, in addition to increasing the level of customer satisfaction, reduces inventory and transportation costs. In this paper, in order to minimize the costs associated with fixed costs, material flow costs, and the costs of building potential centres, a complex integer linear programming model for an integrated direct logistics and RL network design is presented. Due to the outbreak of the ongoing global coronavirus pandemic (COVID-19) at the beginning of 2020 and the consequent increase in medical waste, the need for an inverse logistics system to manage waste is strongly felt. Also, due to the worldwide vaccination in the near future, this waste will increase even more and careful management must be done in this regard. For this purpose, the proposed RL model in the field of COVID-19 waste management and especially vaccine waste has been designed. The network consists of three parts – factory, consumers’ and recycling centres – each of which has different sub-parts. Finally, the proposed model is solved using the cuckoo optimization algorithm, which is one of the newest and most powerful meta-heuristic algorithms, and the computational results are presented along with its sensitivity analysis.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

scholarly journals Stop Plan of Express and Local Train for Regional Rail Transit Line

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qin Luo ◽  
Yufei Hou ◽  
Wei Li ◽  
Xiongfei Zhang
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Programming Model ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Long Distance ◽  
Passenger Travel ◽  
Urban Rail ◽  
Proposed Model ◽  
Rail Line

The urban rail transit line operating in the express and local train mode can solve the problem of disequilibrium passenger flow and space and meet the rapid arrival demand of long-distance passengers. In this paper, the Logit model is used to analyze the behavior of passengers choosing trains by considering the sensitivity of travel time and travel distance. Then, based on the composition of passenger travel time, an integer programming model for train stop scheme, aimed at minimizing the total passenger travel time, is proposed. Finally, combined with a certain regional rail line in Shenzhen, the plan is solved by genetic algorithm and evaluated through the time benefit, carrying capacity, and energy consumption efficiency. The simulation result shows that although the capacity is reduced by 6 trains, the optimized travel time per person is 10.34 min, and the energy consumption is saved by about 16%, which proves that the proposed model is efficient and feasible.

scholarly journals Integrated Harvest and Farm-to-Door Distribution Scheduling with Postharvest Quality Deterioration for Vegetable Online Retailing

Agronomy ◽  
2019 ◽  
Vol 9 (11) ◽  
pp. 724
Author(s):  
Yiping Jiang ◽  
Bei Bian ◽  
Lingling Li
Keyword(s):  
Genetic Algorithm ◽  
Numerical Experiments ◽  
Programming Model ◽  
Time Windows ◽  
Sensitivity Analyses ◽  
Postharvest Quality ◽  
Online Retailing ◽  
Quality Deterioration ◽  
Distribution Scheduling ◽  
Proposed Model

With the rise of vegetable online retailing in recent years, the fulfillment of vegetable online orders has been receiving more and more attention. This paper addresses an integrated optimization model for harvest and farm-to-door distribution scheduling for vegetable online retailing. Firstly, we capture the perishable property of vegetables, and model it as a quadratic postharvest quality deterioration function. Then, we incorporate the postharvest quality deterioration function into the integrated harvest and farm-to-door distribution scheduling and formulate it as a quadratic vehicle routing programming model with time windows. Next, we propose a genetic algorithm with adaptive operators (GAAO) to solve the model. Finally, we carry out numerical experiments to verify the performance of the proposed model and algorithm, and report the results of numerical experiments and sensitivity analyses.

Sign in / Sign up

Export Citation Format

Share Document