Jedrzej Musial

Jedrzej Musial
Poznan University of Technology · Institute of Computing Science

Ph.D. D.Sc. Assoc. Prof.

About

34
Publications
8,974
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
265
Citations
Additional affiliations
August 2012 - present
Poznan University of Technology
Position
  • Research in Electronic Commerce
September 2011 - July 2012
University of Luxembourg
Position
  • Research work in computing science – electronic commerce
October 2006 - August 2011
Poznan University of Technology
Position
  • Research in Electronic Commerce

Publications

Publications (34)
Article
Full-text available
In a round-trip carsharing system, stations must be located in such a way that allow for maximum user coverage with the least walking distance as well as offer certain degrees of flexibility for returning. Therefore, a balance must be stricken between these factors. Providing a satisfactory system can be translated into an optimization problem and...
Article
Full-text available
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which...
Conference Paper
The full version of the paper - https://dl.acm.org/doi/10.1145/3377929.3389941 ----------------------------------------------- The growing awareness of the environmental movement greatly influences the transportation scene of this century leading to several transportation alternatives. One among them is carsharing service which has been gaining tr...
Article
Full-text available
Cloud computing has become one of the major computing paradigms. Not only the number of offered cloud services has grown exponentially but also many different providers compete and propose very similar services. This situation should eventually be beneficial for the customers, but considering that these services slightly differ functionally and non...
Conference Paper
Over the recent years, Unmanned Aerial Vehicles' (UAVs) technology developed rapidly, in turn shedding light on a wide range of potential civil and commercial applications ranging from mapping and surveillance, parcel delivery to more demanding ones that require UAVs to operate in heterogeneous swarms. UAVs are thus expected to soon dominate the sh...
Article
Full-text available
The rapid adoption of Internet of Things (IoT) has encouraged the integration of new connected devices such as Unmanned Aerial Vehicles (UAVs) to the ubiquitous network. UAVs promise a pragmatic solution to the limitations of existing terrestrial IoT infrastructure as well as bring new means of delivering IoT services through a wide range of applic...
Conference Paper
Carsharing services have successfully established their presence and are now growing steadily in many cities around the globe. Carsharing helps to ease traffic congestion and reduce city pollution. To be efficient, carsharing fleet vehicles need to be located on city streets in high population density areas and considering demographics, parking res...
Book
Full-text available
Computer science is constantly developing in a very dynamic way. At the same time, the scope of its applications, solutions and learning necessary to explore the presented problems, is constantly growing. Complicated mathematical calculations, using specially designed sets of instructions (algorithms) can lead to effective solution of problems from...
Article
Full-text available
The most recent incarnation of distributed paradigm is cloud computing. It can be seen as the first widely accepted business model of mass consumption of the distributed computing resources. Despite differences in business models and technical details regarding cloud platforms, the distributed computing underlies cloud. Communications in cloud sys...
Article
Full-text available
Internet shopping is one of the main pillars of electronic commerce.According to the literature, the Internet Shopping Optimization Problem (ISOP)has been defined in order to optimize the global cost of online purchase, taking into account both the cost of products and shipping. In this study, it was decided to propose and analyze a very interestin...
Article
Full-text available
The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bo...
Article
Full-text available
Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm a...
Article
Full-text available
The booming cloud computing industry offers a plethora of services. Navigation through these services is a long and perilous process. Cloud brokers can help in this journey, offering a more comprehensible view to the cloud service customers and service orchestration opportunities. From the service provider perspective, brokers facilitate reaching c...
Article
Full-text available
In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given set of Internet shops. This problem is an extension of the original Internet shopping optimization problem (ISOP) presented in Blazewich et al. (Int...
Article
Full-text available
One of the very important topics in discrete optimization, motivated by practical applications, is Internet shopping, which is becoming increasingly popular each year. More classical versions of the Internet shopping optimization problem (ISOP) are closely related to the facility location problem and some scheduling problems and have been intensive...
Conference Paper
Full-text available
Electronic Commerce is definitely one of the youngest computer science branches. Moreover, we could claim that apart from being a cutting-edge discipline, it is also one of the fastest developing parts of computer science. Revenue of the e-commerce market grows rapidly. One can say that the multidisciplinary nature (connecting many of the well-know...
Article
Full-text available
A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational comp...
Article
Full-text available
With a rapid growth of Internet usage, e-commerce projects, such as content management systems, on-line shops, social networking pages, and online webbased gaming, meet new performance challenges. In this note we enclose information on database systems using MySQL working in the background of web-based applications. Effect of table name length in s...
Chapter
Report [11] states that 32% of EU customers make purchases in Internet stores. By 2013, almost half of Europeans are expected to make a purchase online, up from 21% in 2006. On-line shopping is one of key business activities offered over the Internet. However a high number of Internet shops makes it difficult for a customer to review manually all t...
Conference Paper
Shopping as a social activity may be a source of pleasure even if the shopping is very expensive. However, in many real-life situations customers are interested to buy products at possibly low prices. A shopping paradigm based on price comparison may be applied for both: buying in traditional shops and internet shopping. Unfortunately, price compar...
Article
Full-text available
Internet shopping optimization problem A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited t...
Article
Full-text available
A strong advantage of buying products in on-line shops is a wide choice of alternatives. From customers' point of view it is good to know where to go in order to buy all required products – the entire shopping list – at the best possible price. Making such decisions requires three elements: information where the required products are available, acc...
Article
Full-text available
A common interface for accessing network applications is web browser. However, the beginnings of web-based applications were strongly limited in interaction. In the paper technologies for obtaining smooth interactions in standard browsers are sketched, and then roots and architecture of our solution are presented. It is shown how AJAX technology is...

Network

Cited By

Projects

Project (1)
Archived project
Project http://www.cs.put.poznan.pl/ishop/ Internet Shopping Optimization Project (IShOP) is an INTER POLLUX project, cofunded by Luxembourg National Research Funds (FNR) and the Polish National Research Centre for Research and Development (NCBiR). This project is a collaboration between the Laboratory of Algorithm Design and Programming Systems of the Institute of Computing Science, Poznan University of Technology, Poland, and the Interdisciplinary Center of Security, Reliability and Trust (SnT) of the University of Luxembourg, Luxembourg. ----- The Aim This project proposes innovative and realistic models for different typical online shopping operations, supported by strong mathematical and operational research fundamentals, and well balanced with lightweight computational algorithms. These models are designed in order to allow the optimization of such transactions. Finding accurate solutions to the defined problems implies both lowering customer expenses and favouring market competitiveness. One of the main aims of this project is to model and formulate new advanced and realistic flavours of the Internet Shopping Optimization Problem (ISOP), considering discounts and additional conditions like price sensitive shipping costs, incomplete offers from shops, or the minimization of the total realization time, price, and delivery time functions, among others. The models will be mathematically and theoretically well founded. Moreover, the challenge of defining and addressing a multi-criteria version of the problem will be addressed too. Other important contributions will be the mapping of ISOP to other new challenges. One of them is the design of a novel business model for cloud brokering that will benefit both cloud providers and consumers. Providers will be able to easily offer their large number of services, and to get a fast answer from the market to offers (e.g., when infrastructure is under-utilized). Additionally, customers will easily benefit from offers and find the most appropriate deals for his/her needs (according to service level agreements, pricing, performance, etc.). Modelling some of these aspects and coupling it with an optimization tool for the brokering of cloud services among various providers would be a key contribution to the field. A wide set of optimization algorithms will be designed and developed for the addressed problems. They include from fast lightweight specialized heuristics to highly accurate parallel and multi-objective population-based metaheuristics. They all will be embedded in a software framework for their practical applications, and validation.