Cloud manufacturing is an emerging service-oriented paradigm that works by taking advantage of distributed manufacturing resources and capabilities to collaboratively perform a manufacturing task, with the consideration of QoS (Quality of Service) requirements such as cost, time and quality. Incorporating environmental concerns and sustainability into cloud manufacturing to produce a much greener product has become an urgent issue since there is fierce market competition and an increasing environment consciousness from customers. In this paper, we present a multi-objective optimization approach to selecting and scheduling cloud manufacturing services from the viewpoints of the economy and environment including carbon emissions and water resource. Subject to the carbon cap regulation, a multi-objective model for a cloud manufacturing task is built with the aim of minimizing total costs, carbon emissions, and water resource use. Transportation mode selections and carbon emissions from both cloud manufacturing services and transportation activities are taken into account in this model. The ε-constraint method is employed to obtain the exact Pareto front of optimal solutions. A case study from automobile cloud manufacturing is used to illustrate the effectiveness of the presented approach. Numerical experiments are conducted to compare the presented approach and the simple additive weighting method. The results show that the presented ε-constraint method can obtain a better and more diverse Pareto set of solutions and that it can solve the models in a reasonable time.
With an increasing demand for green and environmentally friendly products, configuring a customized product from modular product design to satisfy both individualized customer requirements and environment restrictions has become a vital task for mass customization. In this paper, we addressed a module-based product configuration problem under carbon emission regulation, i.e., carbon cap-and-trade schema. The configuration problem under carbon cap-and-trade schema was formulated as a mixed-integer programming problem. Due to the NP-hard characteristics of the model, a genetic algorithm was employed to solve the configuration problems under carbon cap-and-trade. Experiments were carried out to analyze the effects of carbon emissions on product configuration decisions and carbon purchasing decisions. As a result, the range for carbon emission cap is suggested for both manufacturers and government agency, which provides the decision supporting for both customized and low-carbon production and green manufacturing.
Nowadays, as a low-carbon and sustainable transport mode bike-sharing systems are increasingly popular all over the world, as they can reduce road congestion and decrease greenhouse gas emissions. Aiming at the problem of the mismatch of bike supply and user demand, the operators have to transfer bikes from surplus stations to deficiency stations to redistribute them among stations by vehicles. In this paper, we consider a mixed fleet of electric vehicles and internal combustion vehicles as well as the traffic restrictions to the traditional vehicles in some metropolises. The mixed integer programming model is firstly established with the objective of minimizing the total rebalancing cost of the mixed fleet. Then, a simulated annealing algorithm enhanced with variable neighborhood structures is designed and applied to a set of randomly generated test instances. The computational results and sensitivity analysis indicate that the proposed algorithm can effectively reduce the total cost of rebalancing.
The bike-sharing system (BSS), as a sustainable way to deal with the “last mile” problem of mass transit systems, is increasingly popular in recent years. Despite its success, the BSS tends to suffer from the mismatch of bike supply and user demand. BSS operators have to transfer bikes from surplus stations to deficit stations to redistribute them among stations by means of trucks. In this paper, we deal with the bike-sharing rebalancing problem with balance intervals (BRP-BIs), which is a variant of the static bike-sharing rebalancing problem. In this problem, the equilibrium of station is characterized by a balance interval instead of a balance point in the literature. We formulate the BRP-BI as a biobjective mixed-integer programming model with the aim of determining both the minimum cost route for a single capacitated vehicle and the maximum average rebalance utility, an index for the balanced degree of station. Then, a multistart multiobjective particle swarm optimization (MS-MOPSO) algorithm is proposed to solve the model such that the Pareto optimal solutions can be derived. The proposed algorithm is extended with crossover operator and variable neighbourhood search to enhance its exploratory capability. Compared with Hybrid NSGA-II and MOPSO, the computational experimental results demonstrate that our MS-MOPSO can obtain Pareto optimal solutions with higher quality.